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-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:23:02,044 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:23:02,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:23:02,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:23:02,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:23:02,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:23:02,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:23:02,066 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:23:02,068 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:23:02,068 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:23:02,069 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:23:02,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:23:02,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:23:02,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:23:02,073 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:23:02,074 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:23:02,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:23:02,076 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:23:02,078 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:23:02,080 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:23:02,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:23:02,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:23:02,085 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:23:02,085 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:23:02,085 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:23:02,086 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:23:02,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:23:02,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:23:02,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:23:02,090 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:23:02,090 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:23:02,091 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:23:02,091 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:23:02,091 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:23:02,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:23:02,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:23:02,094 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:23:02,116 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:23:02,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:23:02,119 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:23:02,119 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:23:02,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:23:02,119 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:23:02,119 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:23:02,120 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:23:02,120 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:23:02,120 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:23:02,120 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:23:02,120 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:23:02,120 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:23:02,121 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:23:02,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:23:02,122 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:23:02,122 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:23:02,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:23:02,122 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:23:02,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:23:02,123 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:23:02,123 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:23:02,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:23:02,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:23:02,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:23:02,123 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:23:02,124 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:23:02,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:23:02,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:23:02,124 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:23:02,124 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:23:02,125 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:23:02,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:23:02,125 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:23:02,125 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:23:02,125 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:23:02,126 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:23:02,128 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:23:02,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:23:02,128 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:23:02,176 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:23:02,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:23:02,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:23:02,196 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:23:02,196 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:23:02,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-02-25 15:23:02,197 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-02-25 15:23:02,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:23:02,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:23:02,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:23:02,254 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:23:02,254 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:23:02,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:23:02,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:23:02,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:23:02,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:23:02,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/1) ... [2019-02-25 15:23:02,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:23:02,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:23:02,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:23:02,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:23:02,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (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:23:02,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:23:02,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:23:02,923 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:23:02,923 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-02-25 15:23:02,925 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:23:02 BoogieIcfgContainer [2019-02-25 15:23:02,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:23:02,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:23:02,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:23:02,929 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:23:02,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:23:02" (1/2) ... [2019-02-25 15:23:02,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a96fb09 and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:23:02, skipping insertion in model container [2019-02-25 15:23:02,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:23:02" (2/2) ... [2019-02-25 15:23:02,932 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-02-25 15:23:02,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:23:02,950 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-02-25 15:23:02,967 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-02-25 15:23:02,997 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:23:02,997 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:23:02,997 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:23:02,998 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:23:02,998 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:23:02,998 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:23:02,998 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:23:02,998 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:23:03,011 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-02-25 15:23:03,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:23:03,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:03,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:23:03,021 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:03,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-02-25 15:23:03,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:03,247 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:23:03,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:03,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:23:03,250 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:03,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:23:03,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:23:03,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:03,277 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-02-25 15:23:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:03,485 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-02-25 15:23:03,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:03,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:23:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:03,502 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:23:03,503 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:23:03,506 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:23:03,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:23:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-02-25 15:23:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:23:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-02-25 15:23:03,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-02-25 15:23:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:03,545 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-02-25 15:23:03,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:23:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-02-25 15:23:03,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:03,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:03,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:03,547 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:03,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:03,547 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-02-25 15:23:03,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:03,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:03,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:03,644 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:23:03,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:03,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:23:03,645 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:03,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:23:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:23:03,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:23:03,648 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-02-25 15:23:03,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:03,896 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-02-25 15:23:03,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:03,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:23:03,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:03,898 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:23:03,898 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:23:03,899 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:23:03,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:23:03,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-02-25 15:23:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:23:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-02-25 15:23:03,904 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-02-25 15:23:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:03,904 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-02-25 15:23:03,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:23:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-02-25 15:23:03,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:03,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:03,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:03,906 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:03,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-02-25 15:23:03,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:03,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:03,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:04,132 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-02-25 15:23:04,139 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:23:04,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:04,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:04,140 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:04,142 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-02-25 15:23:04,175 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:04,176 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:04,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:04,270 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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:23:04,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:04,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:04,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:04,278 INFO 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:23:04,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:04,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:04,329 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:04,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:04,651 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:04,654 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,690 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:04,794 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,887 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,960 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,030 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,217 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:23:05,238 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:05,261 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:05,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:05,295 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:05,315 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:05,418 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:05,419 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,553 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,606 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,638 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,658 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:05,676 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,698 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,759 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 1 xjuncts. [2019-02-25 15:23:05,760 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:05,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:05,858 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:05,860 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:06,021 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:06,022 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:06,091 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:23:06,091 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:06,136 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:23:06,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:06,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:06,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:06,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:06,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:06,158 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-02-25 15:23:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:06,638 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-02-25 15:23:06,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:06,639 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:06,641 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:23:06,641 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:23:06,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:23:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:23:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-02-25 15:23:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:23:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-02-25 15:23:06,648 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-02-25 15:23:06,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:06,649 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-02-25 15:23:06,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-25 15:23:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:06,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:06,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:06,650 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-02-25 15:23:06,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:06,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:06,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:06,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:06,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:06,721 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:23:06,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:06,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:06,722 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:06,722 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-02-25 15:23:06,724 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:06,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:06,732 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:06,732 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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:23:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:06,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:06,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:06,733 INFO 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:23:06,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:06,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:06,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:06,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:06,779 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 24 treesize of output 27 [2019-02-25 15:23:06,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,785 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 27 treesize of output 33 [2019-02-25 15:23:06,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,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 29 treesize of output 43 [2019-02-25 15:23:06,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,824 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 31 treesize of output 57 [2019-02-25 15:23:06,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:06,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:06,948 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:06,979 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:06,980 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,035 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,076 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,110 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,135 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,153 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,171 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,308 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:07,309 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,324 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,336 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,383 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,402 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,431 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,480 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:07,481 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:07,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:07,588 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:07,637 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:07,638 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:07,650 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:23:07,651 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:07,656 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:23:07,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:23:07,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:23:07,675 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:07,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:07,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:07,677 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-02-25 15:23:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:07,763 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-02-25 15:23:07,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:23:07,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:23:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:07,766 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:23:07,766 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:23:07,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:23:07,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-25 15:23:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:23:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-25 15:23:07,773 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-02-25 15:23:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:07,774 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-25 15:23:07,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-25 15:23:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:07,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:07,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:07,775 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:07,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:07,775 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-02-25 15:23:07,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:07,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:07,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:07,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:07,853 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:23:07,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:07,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:07,854 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:07,854 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-02-25 15:23:07,856 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:07,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:07,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:07,862 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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:23:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:07,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:07,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:07,863 INFO 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:23:07,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:07,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:07,887 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:07,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:07,898 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 24 treesize of output 27 [2019-02-25 15:23:07,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,904 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 27 treesize of output 33 [2019-02-25 15:23:07,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,915 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 29 treesize of output 43 [2019-02-25 15:23:07,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,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 31 treesize of output 57 [2019-02-25 15:23:07,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,944 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:07,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:07,969 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:08,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:08,028 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,156 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,252 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,279 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,304 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,328 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,357 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,477 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:08,478 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,562 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,571 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,585 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,603 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,659 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:08,706 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 1 xjuncts. [2019-02-25 15:23:08,707 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:08,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:08,792 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:08,794 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,013 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:09,013 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:09,078 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:23:09,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:09,089 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:23:09,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:09,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:09,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:09,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:09,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:09,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:09,111 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-02-25 15:23:09,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:09,421 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-02-25 15:23:09,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:09,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:09,425 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:23:09,425 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:23:09,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 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:23:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:23:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-02-25 15:23:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:23:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-02-25 15:23:09,434 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-02-25 15:23:09,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:09,434 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-02-25 15:23:09,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-02-25 15:23:09,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:23:09,435 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:09,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:23:09,436 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:09,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-02-25 15:23:09,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:09,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:09,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:09,534 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:23:09,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:09,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:09,535 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:23:09,536 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-02-25 15:23:09,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:09,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:09,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:09,546 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 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:23:09,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:09,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:09,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:09,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:09,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:09,563 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:09,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:09,574 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 24 treesize of output 27 [2019-02-25 15:23:09,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,580 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 27 treesize of output 33 [2019-02-25 15:23:09,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,587 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 29 treesize of output 43 [2019-02-25 15:23:09,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,597 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 31 treesize of output 57 [2019-02-25 15:23:09,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,711 INFO L292 Elim1Store]: Index analysis took 111 ms [2019-02-25 15:23:09,712 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:09,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:09,736 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:09,768 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:09,770 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,811 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,845 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,871 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,889 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,905 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,921 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:09,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:09,988 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,017 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,028 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,039 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,058 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,087 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,141 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 1 xjuncts. [2019-02-25 15:23:10,142 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:10,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:10,228 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:10,228 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:10,269 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:10,269 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:10,284 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:23:10,284 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:10,320 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:23:10,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:10,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:10,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:10,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:10,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:10,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:10,341 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-02-25 15:23:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:10,683 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-02-25 15:23:10,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:10,685 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:23:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:10,686 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:23:10,686 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:23:10,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:23:10,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-25 15:23:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:23:10,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-02-25 15:23:10,698 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-02-25 15:23:10,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:10,698 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-02-25 15:23:10,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:10,699 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-02-25 15:23:10,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:10,699 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:10,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:10,700 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:10,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:10,700 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-02-25 15:23:10,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:10,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:10,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:10,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:10,823 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:23:10,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:10,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:23:10,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:10,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:10,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:10,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:23:10,824 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-02-25 15:23:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:10,943 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-02-25 15:23:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:23:10,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:23:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:10,945 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:23:10,945 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:23:10,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:23:10,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:23:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-02-25 15:23:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:23:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-02-25 15:23:10,953 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-02-25 15:23:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:10,953 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-02-25 15:23:10,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-02-25 15:23:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:10,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:10,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:10,955 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-02-25 15:23:10,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:10,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:10,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:10,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:11,025 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:23:11,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:11,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:11,026 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:11,026 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-02-25 15:23:11,028 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:11,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:11,037 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:11,037 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:23:11,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:11,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:11,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:11,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:23:11,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:11,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:11,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:11,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:11,128 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:11,129 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,189 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,202 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,224 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,253 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,283 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,322 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:23:11,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:11,331 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:11,336 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:11,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:11,347 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:11,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:11,361 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,408 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,440 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,464 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,483 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,500 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,513 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,566 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 1 xjuncts. [2019-02-25 15:23:11,567 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:11,900 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-25 15:23:11,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:11,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:11,925 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:11,998 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:11,999 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:12,024 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:23:12,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:12,032 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:23:12,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:23:12,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:23:12,053 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:12,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:12,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:12,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:12,054 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-02-25 15:23:12,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:12,154 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-02-25 15:23:12,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:12,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:23:12,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:12,155 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:23:12,155 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:23:12,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:23:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:23:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-25 15:23:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:23:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-02-25 15:23:12,165 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-02-25 15:23:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:12,165 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-02-25 15:23:12,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-02-25 15:23:12,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:12,166 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:12,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:12,167 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-02-25 15:23:12,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:12,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:12,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:12,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:12,319 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:12,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:12,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:12,320 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:12,320 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-02-25 15:23:12,322 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:12,322 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:12,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:12,329 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:12,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:12,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:12,330 INFO 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:23:12,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:12,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:12,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:12,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:12,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:12,356 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 24 treesize of output 27 [2019-02-25 15:23:12,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,373 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 27 treesize of output 33 [2019-02-25 15:23:12,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,380 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 29 treesize of output 43 [2019-02-25 15:23:12,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,392 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 31 treesize of output 57 [2019-02-25 15:23:12,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:12,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,426 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:12,459 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:12,461 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,534 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,576 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,604 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,625 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,645 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,662 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,735 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:12,736 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,750 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,760 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,772 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,793 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,823 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:12,871 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:12,871 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:12,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:12,928 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:12,928 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:13,024 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:13,025 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:13,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:13,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:13,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:13,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:13,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:13,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:13,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:13,116 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:13,117 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:13,161 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:13,161 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:23:13,344 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:13,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:13,380 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:23:13,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:13,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:13,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:13,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:13,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:13,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:13,401 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-02-25 15:23:14,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:14,017 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-02-25 15:23:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:14,017 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:14,019 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:23:14,019 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:23:14,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:23:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-02-25 15:23:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:23:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-25 15:23:14,029 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-25 15:23:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:14,029 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-25 15:23:14,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-25 15:23:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:14,030 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:14,030 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:14,030 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:14,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-02-25 15:23:14,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:14,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:14,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:14,352 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:23:14,544 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:14,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:14,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:14,545 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:14,545 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-02-25 15:23:14,546 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:14,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:14,551 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:14,551 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:14,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:14,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:14,552 INFO 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:23:14,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:14,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:14,568 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:14,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:14,574 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 24 treesize of output 27 [2019-02-25 15:23:14,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,583 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 27 treesize of output 33 [2019-02-25 15:23:14,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,590 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 29 treesize of output 43 [2019-02-25 15:23:14,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:14,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,696 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:14,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:14,835 INFO L292 Elim1Store]: Index analysis took 137 ms [2019-02-25 15:23:14,837 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:14,985 INFO L292 Elim1Store]: Index analysis took 146 ms [2019-02-25 15:23:14,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:14,987 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,053 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,085 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,112 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,133 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,152 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,168 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,282 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:15,283 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,301 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,310 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,333 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,356 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,385 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,442 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:15,442 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:15,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:15,528 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,579 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:15,579 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:15,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:15,632 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:15,633 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:15,634 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:15,677 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:15,677 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:23:15,699 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:15,699 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:15,721 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:15,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:15,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:15,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:15,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:15,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:15,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:15,746 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-25 15:23:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:16,196 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-25 15:23:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:16,197 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:16,198 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:23:16,198 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:23:16,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:23:16,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-02-25 15:23:16,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:23:16,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-02-25 15:23:16,208 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-02-25 15:23:16,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:16,208 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-02-25 15:23:16,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:16,208 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-02-25 15:23:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:16,209 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:16,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:16,209 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:16,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-02-25 15:23:16,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:16,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:16,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:16,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:16,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:16,302 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:16,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:16,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:16,303 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:16,303 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-02-25 15:23:16,305 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:16,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:16,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:16,310 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:16,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:16,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:16,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:16,310 INFO 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:23:16,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:16,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:16,326 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:16,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:16,389 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:16,389 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,405 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,420 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,439 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,460 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,490 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,531 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:23:16,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:16,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:16,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:16,558 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:16,562 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:16,579 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:16,580 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,619 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,649 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,672 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,691 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,707 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,720 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,768 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:16,769 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:16,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:16,865 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:16,866 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:16,931 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:16,932 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:17,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,025 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:17,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:17,027 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:17,071 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:17,071 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:23:17,090 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:17,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:17,113 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:17,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:17,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:17,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:17,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:17,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:17,134 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-02-25 15:23:17,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:17,762 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-02-25 15:23:17,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:17,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:17,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:17,763 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:23:17,763 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:23:17,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:23:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:23:17,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-02-25 15:23:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:23:17,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-02-25 15:23:17,773 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-02-25 15:23:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:17,773 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-02-25 15:23:17,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-02-25 15:23:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:17,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:17,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:17,774 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:17,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:17,775 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-02-25 15:23:17,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:17,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:17,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:17,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:17,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:17,906 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:17,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:17,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:17,907 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:17,907 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-02-25 15:23:17,908 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:17,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:17,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:17,913 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:17,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:17,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:17,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:17,914 INFO 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:23:17,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:17,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:17,931 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:17,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:17,936 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 24 treesize of output 27 [2019-02-25 15:23:17,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,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 27 treesize of output 33 [2019-02-25 15:23:17,946 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:17,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,958 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 31 treesize of output 57 [2019-02-25 15:23:17,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,974 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:17,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:17,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:17,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:17,998 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,051 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,249 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,273 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,293 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,372 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,393 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,492 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:18,493 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,524 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,532 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,550 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:18,579 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,609 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,659 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:18,659 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:18,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:18,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:23:18,770 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:18,951 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:18,951 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-25 15:23:19,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,011 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:19,013 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2019-02-25 15:23:19,014 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:19,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:19,192 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 130 [2019-02-25 15:23:19,207 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-02-25 15:23:19,835 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-25 15:23:19,835 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-25 15:23:20,347 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-25 15:23:20,348 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:20,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:20,413 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:23:20,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:20,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:23:20,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:20,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:20,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:20,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:20,443 INFO L87 Difference]: Start difference. First operand 40 states and 149 transitions. Second operand 8 states. [2019-02-25 15:23:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:30,451 INFO L93 Difference]: Finished difference Result 79 states and 233 transitions. [2019-02-25 15:23:30,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:23:30,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:30,452 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:23:30,453 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:23:30,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:23:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-02-25 15:23:30,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:23:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 177 transitions. [2019-02-25 15:23:30,465 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 177 transitions. Word has length 4 [2019-02-25 15:23:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:30,465 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 177 transitions. [2019-02-25 15:23:30,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 177 transitions. [2019-02-25 15:23:30,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:30,466 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:30,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:30,466 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:30,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:30,467 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-02-25 15:23:30,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:30,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:30,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:30,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:30,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:30,555 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:23:30,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:23:30,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:23:30,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:23:30,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:23:30,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:23:30,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:23:30,557 INFO L87 Difference]: Start difference. First operand 41 states and 177 transitions. Second operand 4 states. [2019-02-25 15:23:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:31,259 INFO L93 Difference]: Finished difference Result 53 states and 195 transitions. [2019-02-25 15:23:31,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:23:31,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:23:31,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:31,260 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:23:31,260 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:23:31,261 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:23:31,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:23:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-02-25 15:23:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:23:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 186 transitions. [2019-02-25 15:23:31,271 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 186 transitions. Word has length 4 [2019-02-25 15:23:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:31,272 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 186 transitions. [2019-02-25 15:23:31,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:23:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 186 transitions. [2019-02-25 15:23:31,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:31,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:31,273 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:31,273 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash 929876, now seen corresponding path program 1 times [2019-02-25 15:23:31,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:31,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:31,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:31,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:31,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:31,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:23:31,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:31,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:31,358 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:31,358 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [31] [2019-02-25 15:23:31,359 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:31,359 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:31,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:31,363 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:31,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:31,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:31,365 INFO 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:23:31,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:31,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:31,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:31,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:31,426 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:31,427 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,452 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,462 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,484 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,508 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,539 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,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:23:31,579 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:31,581 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:31,597 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:31,602 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:31,605 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:31,615 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:31,616 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,655 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,689 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,756 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,774 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,791 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,806 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,854 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 1 xjuncts. [2019-02-25 15:23:31,854 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:31,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,926 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:31,927 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:31,970 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:31,971 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:31,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:31,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:32,002 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:32,066 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:32,066 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:23:32,085 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,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:32,100 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:23:32,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:32,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:23:32,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:32,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:32,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:32,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:32,122 INFO L87 Difference]: Start difference. First operand 43 states and 186 transitions. Second operand 8 states. [2019-02-25 15:23:32,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:32,758 INFO L93 Difference]: Finished difference Result 87 states and 278 transitions. [2019-02-25 15:23:32,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:32,759 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:32,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:32,760 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:23:32,760 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:23:32,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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:23:32,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:23:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2019-02-25 15:23:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:23:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 149 transitions. [2019-02-25 15:23:32,772 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 149 transitions. Word has length 4 [2019-02-25 15:23:32,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:32,773 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 149 transitions. [2019-02-25 15:23:32,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 149 transitions. [2019-02-25 15:23:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:32,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:32,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:32,774 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-02-25 15:23:32,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:32,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:32,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:32,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:32,813 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:23:32,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:32,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:32,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:32,814 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [33] [2019-02-25 15:23:32,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:32,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:32,821 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:32,821 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:23:32,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:32,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:32,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:32,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 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:23:32,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:32,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:32,839 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:23:32,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:32,864 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 24 treesize of output 27 [2019-02-25 15:23:32,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,872 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 27 treesize of output 33 [2019-02-25 15:23:32,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,879 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 29 treesize of output 43 [2019-02-25 15:23:32,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,891 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 31 treesize of output 57 [2019-02-25 15:23:32,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,902 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:32,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:32,930 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:32,982 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:32,983 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,025 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,055 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,082 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,102 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,119 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,134 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,194 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:33,195 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,211 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,225 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,248 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,275 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,305 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,355 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 1 xjuncts. [2019-02-25 15:23:33,356 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:33,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:33,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:33,440 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:33,496 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:33,497 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:33,517 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:23:33,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:33,538 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:23:33,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:33,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:23:33,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:33,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:23:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:23:33,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:23:33,558 INFO L87 Difference]: Start difference. First operand 41 states and 149 transitions. Second operand 6 states. [2019-02-25 15:23:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:33,763 INFO L93 Difference]: Finished difference Result 64 states and 185 transitions. [2019-02-25 15:23:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:23:33,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:23:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:33,765 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:23:33,765 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:23:33,766 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:23:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:23:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-02-25 15:23:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:23:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 157 transitions. [2019-02-25 15:23:33,776 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 157 transitions. Word has length 4 [2019-02-25 15:23:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:33,776 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 157 transitions. [2019-02-25 15:23:33,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:23:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 157 transitions. [2019-02-25 15:23:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:33,777 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:33,777 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:33,778 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:33,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:33,778 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-02-25 15:23:33,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:33,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:33,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:33,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:33,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:33,937 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-02-25 15:23:33,966 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:33,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:33,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:33,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:33,967 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [31] [2019-02-25 15:23:33,968 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:33,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:33,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:33,973 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:33,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:33,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:33,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:33,974 INFO 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:23:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:33,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:33,988 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:33,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:33,996 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 24 treesize of output 27 [2019-02-25 15:23:33,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,000 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 27 treesize of output 33 [2019-02-25 15:23:34,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,023 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 29 treesize of output 43 [2019-02-25 15:23:34,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,030 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 31 treesize of output 57 [2019-02-25 15:23:34,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,042 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:34,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:34,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:34,066 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,109 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,142 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,167 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,189 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,209 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,226 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,289 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:34,290 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,304 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,316 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,332 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,353 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,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:34,431 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:34,432 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:34,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:34,502 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,548 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:34,548 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:34,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:34,601 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:34,602 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:34,645 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:34,645 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:23:34,666 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:34,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:34,683 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:23:34,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:34,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:23:34,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:34,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:34,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:34,704 INFO L87 Difference]: Start difference. First operand 42 states and 157 transitions. Second operand 8 states. [2019-02-25 15:23:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:35,709 INFO L93 Difference]: Finished difference Result 98 states and 268 transitions. [2019-02-25 15:23:35,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:23:35,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:35,711 INFO L225 Difference]: With dead ends: 98 [2019-02-25 15:23:35,711 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:23:35,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:23:35,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:23:35,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 47. [2019-02-25 15:23:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:23:35,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 197 transitions. [2019-02-25 15:23:35,729 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 197 transitions. Word has length 4 [2019-02-25 15:23:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:35,729 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 197 transitions. [2019-02-25 15:23:35,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 197 transitions. [2019-02-25 15:23:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:35,730 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:35,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:35,730 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-02-25 15:23:35,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:35,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:35,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:35,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:35,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:36,118 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-25 15:23:36,281 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2019-02-25 15:23:36,387 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:36,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:36,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:36,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:36,388 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [31] [2019-02-25 15:23:36,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:36,390 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:36,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:36,395 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:36,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:36,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:36,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:36,396 INFO 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:23:36,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:36,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:36,430 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:36,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:36,451 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:23:36,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,489 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 27 treesize of output 33 [2019-02-25 15:23:36,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,505 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 29 treesize of output 43 [2019-02-25 15:23:36,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,521 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 31 treesize of output 57 [2019-02-25 15:23:36,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:36,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,548 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:36,567 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:36,568 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,610 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,644 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,670 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,692 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,707 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,722 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:36,786 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,802 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,813 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,827 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,850 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,879 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:36,930 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:36,930 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:36,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:36,975 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:36,975 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,016 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:37,017 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:37,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:37,050 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:37,050 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:37,391 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:37,392 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:23:37,411 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:37,411 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:37,442 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:23:37,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:37,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:37,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:37,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:37,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:37,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:37,463 INFO L87 Difference]: Start difference. First operand 47 states and 197 transitions. Second operand 8 states. [2019-02-25 15:23:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:37,901 INFO L93 Difference]: Finished difference Result 91 states and 282 transitions. [2019-02-25 15:23:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:37,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:37,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:37,903 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:23:37,903 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:23:37,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:23:37,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:23:37,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-02-25 15:23:37,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-25 15:23:37,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 243 transitions. [2019-02-25 15:23:37,919 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 243 transitions. Word has length 4 [2019-02-25 15:23:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:37,920 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 243 transitions. [2019-02-25 15:23:37,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:37,920 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 243 transitions. [2019-02-25 15:23:37,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:37,921 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:37,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:37,921 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-02-25 15:23:37,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:37,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:37,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:37,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:37,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:38,111 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:23:38,125 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:38,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:38,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:38,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:38,126 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [31] [2019-02-25 15:23:38,127 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:38,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:38,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:38,131 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:38,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:38,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:38,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:38,131 INFO 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:23:38,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:38,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:38,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:38,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:38,465 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:38,466 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,779 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:38,896 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,093 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,349 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:39,749 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:40,173 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:23:40,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:40,206 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:23:40,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:23:40,235 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:40,250 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:40,407 INFO L292 Elim1Store]: Index analysis took 154 ms [2019-02-25 15:23:40,408 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:40,409 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:40,960 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,392 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,539 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,558 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,574 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,588 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,637 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:41,638 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:41,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:41,730 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:23:41,731 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,861 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:41,861 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:23:41,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:41,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:41,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:41,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:41,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:41,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:41,893 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:41,894 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:23:41,895 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:41,938 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:41,938 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:23:41,958 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:41,959 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:41,986 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:42,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:42,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:23:42,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:42,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:42,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:42,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:23:42,007 INFO L87 Difference]: Start difference. First operand 56 states and 243 transitions. Second operand 8 states. [2019-02-25 15:23:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:23:42,431 INFO L93 Difference]: Finished difference Result 92 states and 291 transitions. [2019-02-25 15:23:42,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:23:42,431 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:23:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:23:42,433 INFO L225 Difference]: With dead ends: 92 [2019-02-25 15:23:42,433 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:23:42,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 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:23:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:23:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-02-25 15:23:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:23:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 254 transitions. [2019-02-25 15:23:42,450 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 254 transitions. Word has length 4 [2019-02-25 15:23:42,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:23:42,450 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 254 transitions. [2019-02-25 15:23:42,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:23:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 254 transitions. [2019-02-25 15:23:42,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:23:42,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:23:42,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:23:42,451 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:23:42,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:42,452 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-02-25 15:23:42,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:23:42,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:42,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:42,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:23:42,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:23:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:42,595 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:42,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:42,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:23:42,595 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:23:42,596 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [31] [2019-02-25 15:23:42,599 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:23:42,599 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:23:42,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:23:42,602 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:42,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:23:42,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:23:42,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:23:42,603 INFO 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:23:42,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:23:42,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:23:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:23:42,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:23:42,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:23:42,655 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 24 treesize of output 27 [2019-02-25 15:23:42,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:23:42,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,686 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 29 treesize of output 43 [2019-02-25 15:23:42,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,694 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 31 treesize of output 57 [2019-02-25 15:23:42,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:23:42,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:42,751 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:23:42,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:23:42,768 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,805 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,835 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,859 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,879 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,896 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:42,911 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,114 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:23:43,115 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,128 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,139 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,156 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,177 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:23:43,205 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,251 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:23:43,252 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:23:43,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:23:43,353 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:23:43,503 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 15:23:43,503 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-02-25 15:23:43,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:43,624 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 130 [2019-02-25 15:23:43,634 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-25 15:23:44,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:23:44,392 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:23:44,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 91 [2019-02-25 15:23:44,393 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:23:44,646 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-02-25 15:23:44,646 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-02-25 15:23:45,413 WARN L181 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-02-25 15:23:45,415 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:45,415 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:23:45,443 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:23:45,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:23:45,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:23:45,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:23:45,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:23:45,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:23:45,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:23:45,463 INFO L87 Difference]: Start difference. First operand 59 states and 254 transitions. Second operand 8 states. [2019-02-25 15:24:01,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:01,696 INFO L93 Difference]: Finished difference Result 101 states and 344 transitions. [2019-02-25 15:24:01,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:01,697 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:01,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:01,698 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:24:01,698 INFO L226 Difference]: Without dead ends: 100 [2019-02-25 15:24:01,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=44, Invalid=65, Unknown=1, NotChecked=0, Total=110 [2019-02-25 15:24:01,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-25 15:24:01,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2019-02-25 15:24:01,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:24:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 286 transitions. [2019-02-25 15:24:01,715 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 286 transitions. Word has length 4 [2019-02-25 15:24:01,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:01,716 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 286 transitions. [2019-02-25 15:24:01,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:01,716 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 286 transitions. [2019-02-25 15:24:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:01,716 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:01,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:01,717 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash 951454, now seen corresponding path program 1 times [2019-02-25 15:24:01,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:01,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:01,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:01,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:01,778 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:24:01,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:01,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:01,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:01,779 INFO L207 CegarAbsIntRunner]: [0], [28], [32], [33] [2019-02-25 15:24:01,780 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:01,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:01,784 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:01,784 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:24:01,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:01,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:01,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:01,785 INFO 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:24:01,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:01,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:01,807 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:24:01,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:01,878 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:01,879 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:01,904 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:01,930 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:01,957 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:01,997 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,040 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,096 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,153 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:02,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:02,158 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:02,161 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:02,163 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:02,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:02,170 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:02,170 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,219 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,277 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,498 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,516 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,529 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,543 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,607 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 1 xjuncts. [2019-02-25 15:24:02,608 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-25 15:24:02,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:02,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:02,631 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:02,701 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:02,701 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:02,749 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:24:02,750 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:02,759 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:24:02,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:02,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:02,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:02,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:02,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:02,777 INFO L87 Difference]: Start difference. First operand 63 states and 286 transitions. Second operand 6 states. [2019-02-25 15:24:03,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:03,000 INFO L93 Difference]: Finished difference Result 86 states and 322 transitions. [2019-02-25 15:24:03,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:03,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:24:03,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:03,002 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:24:03,002 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:24:03,003 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:24:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:24:03,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-02-25 15:24:03,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:24:03,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 294 transitions. [2019-02-25 15:24:03,015 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 294 transitions. Word has length 4 [2019-02-25 15:24:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:03,015 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 294 transitions. [2019-02-25 15:24:03,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 294 transitions. [2019-02-25 15:24:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:03,016 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:03,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:03,016 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:03,017 INFO L82 PathProgramCache]: Analyzing trace with hash 951266, now seen corresponding path program 2 times [2019-02-25 15:24:03,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:03,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:03,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:03,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:03,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:03,110 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:03,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:03,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:03,111 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:03,111 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:03,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:03,112 INFO 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:24:03,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:24:03,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:24:03,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:24:03,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:03,128 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:03,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:03,135 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 24 treesize of output 27 [2019-02-25 15:24:03,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,142 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 27 treesize of output 33 [2019-02-25 15:24:03,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,151 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 29 treesize of output 43 [2019-02-25 15:24:03,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,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 31 treesize of output 57 [2019-02-25 15:24:03,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:03,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,196 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,201 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:03,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,212 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,213 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:03,214 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,275 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,306 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,331 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,371 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,389 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,405 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,483 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:03,484 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,511 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,542 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,571 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,616 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,653 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,694 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,759 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:03,759 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:24:03,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:03,840 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:03,841 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:03,996 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:03,996 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:04,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,041 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:04,041 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,098 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:04,098 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-02-25 15:24:04,118 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:04,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:04,135 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:04,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:04,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:04,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:04,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:04,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:04,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:04,154 INFO L87 Difference]: Start difference. First operand 64 states and 294 transitions. Second operand 8 states. [2019-02-25 15:24:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:04,720 INFO L93 Difference]: Finished difference Result 119 states and 384 transitions. [2019-02-25 15:24:04,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:04,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:24:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:04,722 INFO L225 Difference]: With dead ends: 119 [2019-02-25 15:24:04,722 INFO L226 Difference]: Without dead ends: 115 [2019-02-25 15:24:04,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:04,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-25 15:24:04,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2019-02-25 15:24:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:24:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 286 transitions. [2019-02-25 15:24:04,740 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 286 transitions. Word has length 4 [2019-02-25 15:24:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:04,741 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 286 transitions. [2019-02-25 15:24:04,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:04,741 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 286 transitions. [2019-02-25 15:24:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:24:04,742 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:04,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:24:04,742 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:04,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash 938000, now seen corresponding path program 1 times [2019-02-25 15:24:04,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:04,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:04,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:04,840 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:24:04,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:04,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:04,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:24:04,841 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [33] [2019-02-25 15:24:04,842 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:04,842 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:04,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:04,845 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 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:24:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:04,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:04,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:04,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:04,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:04,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:04,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:04,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:04,867 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 24 treesize of output 27 [2019-02-25 15:24:04,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,872 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 27 treesize of output 33 [2019-02-25 15:24:04,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,879 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 29 treesize of output 43 [2019-02-25 15:24:04,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,885 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 31 treesize of output 57 [2019-02-25 15:24:04,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,892 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:04,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:04,905 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:04,921 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:04,922 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,961 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:04,992 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,016 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,036 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,052 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,067 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,125 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:05,125 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,140 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,149 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,165 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,182 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,281 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,327 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 1 xjuncts. [2019-02-25 15:24:05,328 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:05,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:05,363 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:05,363 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:05,403 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:05,404 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:05,424 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:24:05,424 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:05,434 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:24:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:05,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:05,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:05,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:05,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:05,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:05,454 INFO L87 Difference]: Start difference. First operand 67 states and 286 transitions. Second operand 6 states. [2019-02-25 15:24:05,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:05,691 INFO L93 Difference]: Finished difference Result 90 states and 322 transitions. [2019-02-25 15:24:05,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:05,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:24:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:05,694 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:24:05,694 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:24:05,694 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:24:05,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:24:05,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-02-25 15:24:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-25 15:24:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 294 transitions. [2019-02-25 15:24:05,714 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 294 transitions. Word has length 4 [2019-02-25 15:24:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:05,715 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 294 transitions. [2019-02-25 15:24:05,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 294 transitions. [2019-02-25 15:24:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:05,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:05,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:05,716 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:05,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:05,716 INFO L82 PathProgramCache]: Analyzing trace with hash 29197230, now seen corresponding path program 1 times [2019-02-25 15:24:05,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:05,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:05,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:05,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:06,298 WARN L181 SmtUtils]: Spent 532.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-02-25 15:24:06,323 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:24:06,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:06,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:06,323 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:06,324 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [35] [2019-02-25 15:24:06,325 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:06,325 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:06,328 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:06,329 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:24:06,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:06,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:06,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:06,329 INFO 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:24:06,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:06,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:06,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:24:06,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:06,367 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 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:06,367 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,380 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,388 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,400 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,425 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,455 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 24 treesize of output 27 [2019-02-25 15:24:06,459 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 27 treesize of output 33 [2019-02-25 15:24:06,462 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:24:06,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, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-25 15:24:06,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, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:24:06,475 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:24:06,484 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:24:06,485 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,518 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,543 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,567 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,581 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,596 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,609 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,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 1 xjuncts. [2019-02-25 15:24:06,673 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-02-25 15:24:06,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:06,713 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:24:06,713 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:06,749 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:06,749 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-25 15:24:06,769 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:24:06,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:06,777 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:24:06,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:06,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 6 [2019-02-25 15:24:06,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:06,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:24:06,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:24:06,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:06,797 INFO L87 Difference]: Start difference. First operand 68 states and 294 transitions. Second operand 7 states. [2019-02-25 15:24:07,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:07,129 INFO L93 Difference]: Finished difference Result 77 states and 308 transitions. [2019-02-25 15:24:07,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:07,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-25 15:24:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:07,131 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:24:07,131 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:24:07,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:24:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-02-25 15:24:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:24:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 301 transitions. [2019-02-25 15:24:07,148 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 301 transitions. Word has length 5 [2019-02-25 15:24:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:07,148 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 301 transitions. [2019-02-25 15:24:07,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:24:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 301 transitions. [2019-02-25 15:24:07,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:07,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:07,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:07,149 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash 29172180, now seen corresponding path program 1 times [2019-02-25 15:24:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:07,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:07,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:07,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:07,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:07,243 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:07,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:07,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:07,243 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:07,243 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [33] [2019-02-25 15:24:07,244 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:07,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:07,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:07,247 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:07,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:07,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:07,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:07,248 INFO 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:24:07,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:07,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:07,282 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:07,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:07,301 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 24 treesize of output 27 [2019-02-25 15:24:07,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,338 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 27 treesize of output 33 [2019-02-25 15:24:07,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,402 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 29 treesize of output 43 [2019-02-25 15:24:07,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,487 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 31 treesize of output 57 [2019-02-25 15:24:07,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,567 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:07,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,575 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:07,589 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:07,590 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,629 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,660 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,685 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,705 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,721 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,736 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,794 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:07,794 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,808 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,818 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,834 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,852 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,879 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:07,925 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:07,925 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:07,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:07,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:07,971 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,011 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:08,011 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:08,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:08,041 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:08,042 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,081 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:08,081 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:08,100 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:08,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:08,122 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:08,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:08,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:08,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:08,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:08,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:08,142 INFO L87 Difference]: Start difference. First operand 69 states and 301 transitions. Second operand 8 states. [2019-02-25 15:24:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:08,578 INFO L93 Difference]: Finished difference Result 102 states and 353 transitions. [2019-02-25 15:24:08,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:08,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:08,579 INFO L225 Difference]: With dead ends: 102 [2019-02-25 15:24:08,580 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:24:08,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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:24:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:24:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-02-25 15:24:08,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:24:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 317 transitions. [2019-02-25 15:24:08,604 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 317 transitions. Word has length 5 [2019-02-25 15:24:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:08,604 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 317 transitions. [2019-02-25 15:24:08,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:08,604 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 317 transitions. [2019-02-25 15:24:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:08,605 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:08,605 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:08,605 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:08,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash 29171496, now seen corresponding path program 1 times [2019-02-25 15:24:08,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:08,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:08,775 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:24:08,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:08,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:08,776 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:08,776 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [31] [2019-02-25 15:24:08,777 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:08,778 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:08,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:08,781 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:08,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:08,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:08,782 INFO 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:24:08,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:08,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:08,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:08,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:08,840 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:08,840 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,855 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,863 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,874 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,893 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,921 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:08,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:08,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:08,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:08,965 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:08,967 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:08,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:08,980 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:08,981 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,015 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,044 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,066 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,083 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,098 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,111 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:09,164 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:09,164 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:11,204 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-02-25 15:24:11,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,210 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:11,210 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,250 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:11,251 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:11,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:11,285 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,325 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:11,325 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:11,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:11,357 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:11,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:11,359 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:11,396 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:11,396 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:11,413 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:11,414 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:11,474 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:24:11,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:11,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:24:11,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:11,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:11,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:11,495 INFO L87 Difference]: Start difference. First operand 71 states and 317 transitions. Second operand 10 states. [2019-02-25 15:24:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:12,797 INFO L93 Difference]: Finished difference Result 147 states and 540 transitions. [2019-02-25 15:24:12,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:24:12,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:12,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:12,799 INFO L225 Difference]: With dead ends: 147 [2019-02-25 15:24:12,799 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:24:12,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:24:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2019-02-25 15:24:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:24:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 464 transitions. [2019-02-25 15:24:12,829 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 464 transitions. Word has length 5 [2019-02-25 15:24:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:12,829 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 464 transitions. [2019-02-25 15:24:12,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 464 transitions. [2019-02-25 15:24:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:12,829 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:12,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:12,830 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash 29187556, now seen corresponding path program 1 times [2019-02-25 15:24:12,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:12,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:12,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:12,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:12,971 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:12,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:12,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:12,972 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:12,972 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [33] [2019-02-25 15:24:12,973 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:12,973 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:12,975 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:12,975 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:12,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:12,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:12,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:12,976 INFO 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:24:12,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:12,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:12,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:12,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:12,997 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 24 treesize of output 27 [2019-02-25 15:24:13,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,002 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 27 treesize of output 33 [2019-02-25 15:24:13,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,034 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 29 treesize of output 43 [2019-02-25 15:24:13,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,041 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 31 treesize of output 57 [2019-02-25 15:24:13,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:13,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,077 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:13,088 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:13,089 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,128 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,159 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,183 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,203 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,218 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,233 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,289 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:13,289 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,303 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,313 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,330 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,355 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,382 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,428 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:13,429 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:13,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,469 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:13,469 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,510 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:13,510 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:13,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:13,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:13,538 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:13,577 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:13,577 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:13,597 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:13,597 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:13,617 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:13,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:13,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:13,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:13,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:13,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:13,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:13,636 INFO L87 Difference]: Start difference. First operand 89 states and 464 transitions. Second operand 8 states. [2019-02-25 15:24:14,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:14,071 INFO L93 Difference]: Finished difference Result 128 states and 531 transitions. [2019-02-25 15:24:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:14,071 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:14,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:14,073 INFO L225 Difference]: With dead ends: 128 [2019-02-25 15:24:14,073 INFO L226 Difference]: Without dead ends: 127 [2019-02-25 15:24:14,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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:24:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-25 15:24:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-02-25 15:24:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:24:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 488 transitions. [2019-02-25 15:24:14,104 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 488 transitions. Word has length 5 [2019-02-25 15:24:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:14,104 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 488 transitions. [2019-02-25 15:24:14,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 488 transitions. [2019-02-25 15:24:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:14,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:14,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:14,105 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 29187368, now seen corresponding path program 1 times [2019-02-25 15:24:14,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:14,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:14,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:14,301 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-02-25 15:24:14,338 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:14,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:14,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:14,338 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:14,338 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [31] [2019-02-25 15:24:14,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:14,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:14,342 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:14,343 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:14,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:14,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:14,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:14,343 INFO 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:24:14,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:14,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:14,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:14,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:14,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:14,371 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 24 treesize of output 27 [2019-02-25 15:24:14,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,379 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 27 treesize of output 33 [2019-02-25 15:24:14,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,393 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 29 treesize of output 43 [2019-02-25 15:24:14,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,400 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 31 treesize of output 57 [2019-02-25 15:24:14,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:14,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,419 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:14,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:14,429 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,470 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,501 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,526 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,543 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,560 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,574 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,628 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:14,629 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,645 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,658 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,672 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,693 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,719 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:14,765 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:24:14,765 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:14,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:14,865 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:14,865 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,012 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:15,013 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:15,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,048 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:15,048 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,088 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:15,089 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:15,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:15,122 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:15,123 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:15,124 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:15,163 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:15,164 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:15,202 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:15,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:15,237 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:24:15,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:15,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:15,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:15,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:15,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:15,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:15,256 INFO L87 Difference]: Start difference. First operand 92 states and 488 transitions. Second operand 10 states. [2019-02-25 15:24:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:15,959 INFO L93 Difference]: Finished difference Result 146 states and 591 transitions. [2019-02-25 15:24:15,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:15,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:15,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:15,961 INFO L225 Difference]: With dead ends: 146 [2019-02-25 15:24:15,962 INFO L226 Difference]: Without dead ends: 144 [2019-02-25 15:24:15,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-02-25 15:24:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2019-02-25 15:24:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:24:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 536 transitions. [2019-02-25 15:24:16,008 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 536 transitions. Word has length 5 [2019-02-25 15:24:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:16,008 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 536 transitions. [2019-02-25 15:24:16,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 536 transitions. [2019-02-25 15:24:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:16,009 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:16,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:16,009 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:16,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash 29175836, now seen corresponding path program 1 times [2019-02-25 15:24:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:16,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:16,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:16,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:16,126 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:16,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:16,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:16,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:16,127 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [31] [2019-02-25 15:24:16,128 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:16,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:16,130 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:16,130 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:16,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:16,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:16,131 INFO 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:24:16,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:16,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:16,149 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:16,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:16,152 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 24 treesize of output 27 [2019-02-25 15:24:16,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,158 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 27 treesize of output 33 [2019-02-25 15:24:16,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,163 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 29 treesize of output 43 [2019-02-25 15:24:16,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,169 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 31 treesize of output 57 [2019-02-25 15:24:16,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:16,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:16,211 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:16,212 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,251 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,282 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,307 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,327 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,342 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,357 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,415 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:16,416 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,430 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,442 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,458 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,475 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,503 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,549 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:24:16,549 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:16,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,615 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:16,615 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,654 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:16,655 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:16,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,686 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:16,687 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:16,688 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,731 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:16,732 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:24:16,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:16,796 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:16,797 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:24:16,804 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:16,843 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:16,843 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:59 [2019-02-25 15:24:16,867 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:16,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:16,922 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:16,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:16,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:16,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:16,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:16,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:16,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:16,941 INFO L87 Difference]: Start difference. First operand 98 states and 536 transitions. Second operand 10 states. [2019-02-25 15:24:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:18,265 INFO L93 Difference]: Finished difference Result 140 states and 582 transitions. [2019-02-25 15:24:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:18,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:18,268 INFO L225 Difference]: With dead ends: 140 [2019-02-25 15:24:18,268 INFO L226 Difference]: Without dead ends: 138 [2019-02-25 15:24:18,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:24:18,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-25 15:24:18,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2019-02-25 15:24:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:24:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 486 transitions. [2019-02-25 15:24:18,302 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 486 transitions. Word has length 5 [2019-02-25 15:24:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:18,302 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 486 transitions. [2019-02-25 15:24:18,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 486 transitions. [2019-02-25 15:24:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:18,303 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:18,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:18,303 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 29191274, now seen corresponding path program 1 times [2019-02-25 15:24:18,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:18,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:18,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:18,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:18,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:18,477 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-25 15:24:18,518 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:18,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:18,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:18,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:18,519 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [31] [2019-02-25 15:24:18,520 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:18,520 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:18,524 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:18,524 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:18,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:18,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:18,525 INFO 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:24:18,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:18,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:18,539 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:18,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:18,565 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:18,566 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,582 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,591 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,608 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,634 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,663 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,697 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:18,700 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:18,702 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:18,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:18,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:18,709 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:18,717 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:18,718 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,755 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,783 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,805 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,822 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,836 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,850 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:18,896 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:24:18,896 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:18,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:18,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:24:18,950 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:19,095 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:19,095 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-25 15:24:19,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,314 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:19,314 INFO L292 Elim1Store]: Index analysis took 167 ms [2019-02-25 15:24:19,315 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 101 [2019-02-25 15:24:19,316 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:19,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,426 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:19,435 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 118 [2019-02-25 15:24:19,436 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:19,653 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-25 15:24:19,653 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:191 [2019-02-25 15:24:19,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,764 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:19,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 124 [2019-02-25 15:24:19,815 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:24:20,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:20,238 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:20,239 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 93 [2019-02-25 15:24:20,240 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:20,427 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:24:20,428 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-25 15:24:20,811 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-25 15:24:20,813 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:20,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:20,862 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:24:20,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:20,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:24:20,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:20,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:20,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:20,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:20,883 INFO L87 Difference]: Start difference. First operand 92 states and 486 transitions. Second operand 10 states. [2019-02-25 15:24:21,204 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-02-25 15:24:22,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:22,901 INFO L93 Difference]: Finished difference Result 155 states and 683 transitions. [2019-02-25 15:24:22,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:24:22,902 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:22,903 INFO L225 Difference]: With dead ends: 155 [2019-02-25 15:24:22,904 INFO L226 Difference]: Without dead ends: 154 [2019-02-25 15:24:22,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-25 15:24:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 98. [2019-02-25 15:24:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:24:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 534 transitions. [2019-02-25 15:24:22,938 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 534 transitions. Word has length 5 [2019-02-25 15:24:22,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:22,938 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 534 transitions. [2019-02-25 15:24:22,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:22,938 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 534 transitions. [2019-02-25 15:24:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:22,939 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:22,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:22,939 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 29193322, now seen corresponding path program 1 times [2019-02-25 15:24:22,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:22,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:22,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:22,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:23,008 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:23,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:23,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:23,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:23,009 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [32], [33] [2019-02-25 15:24:23,009 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:23,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:23,011 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:23,012 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:23,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:23,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:23,012 INFO 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:24:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:23,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:23,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:23,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:23,066 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:23,066 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,110 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,120 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,141 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,165 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,201 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,244 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,296 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:23,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:23,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, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:23,304 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:23,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, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:23,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, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:23,330 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:23,331 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,400 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,429 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,451 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,468 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,482 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,495 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,559 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:23,560 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:24:23,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:23,587 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,662 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:23,663 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:23,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:23,703 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:23,703 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:23,760 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:23,760 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:24:23,788 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:23,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:23,808 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:23,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:23,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:23,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:23,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:23,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:23,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:23,827 INFO L87 Difference]: Start difference. First operand 98 states and 534 transitions. Second operand 8 states. [2019-02-25 15:24:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:24,409 INFO L93 Difference]: Finished difference Result 137 states and 601 transitions. [2019-02-25 15:24:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:24,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:24,412 INFO L225 Difference]: With dead ends: 137 [2019-02-25 15:24:24,412 INFO L226 Difference]: Without dead ends: 132 [2019-02-25 15:24:24,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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:24:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-02-25 15:24:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 100. [2019-02-25 15:24:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-25 15:24:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 556 transitions. [2019-02-25 15:24:24,464 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 556 transitions. Word has length 5 [2019-02-25 15:24:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:24,464 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 556 transitions. [2019-02-25 15:24:24,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 556 transitions. [2019-02-25 15:24:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:24,465 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:24,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:24,465 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:24,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash 29193134, now seen corresponding path program 2 times [2019-02-25 15:24:24,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:24,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:24,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:24,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:24:24,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:24,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:24,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:24,600 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:24,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:24,600 INFO 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:24:24,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:24:24,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:24:24,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:24:24,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:24,617 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:24:24,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:24,663 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:24,664 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,685 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,696 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,713 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,739 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,768 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,811 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,863 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:24,867 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:24,869 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:24,872 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:24,876 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:24,879 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:24,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:24,882 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,947 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,975 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:24,997 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,015 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,029 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,043 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,107 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:24:25,107 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:24:25,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,182 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:25,183 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,246 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:25,246 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:25,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,291 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:25,291 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,348 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:25,349 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:24:25,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:25,390 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:25,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:25,392 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:25,449 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:25,449 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:24:25,473 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:25,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:25,513 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:24:25,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:25,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:25,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:25,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:25,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:25,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:25,532 INFO L87 Difference]: Start difference. First operand 100 states and 556 transitions. Second operand 10 states. [2019-02-25 15:24:26,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:26,265 INFO L93 Difference]: Finished difference Result 154 states and 681 transitions. [2019-02-25 15:24:26,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:26,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:26,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:26,267 INFO L225 Difference]: With dead ends: 154 [2019-02-25 15:24:26,267 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:24:26,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:26,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:24:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 109. [2019-02-25 15:24:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:24:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 628 transitions. [2019-02-25 15:24:26,326 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 628 transitions. Word has length 5 [2019-02-25 15:24:26,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:26,326 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 628 transitions. [2019-02-25 15:24:26,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 628 transitions. [2019-02-25 15:24:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:26,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:26,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:26,327 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:26,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash 29179868, now seen corresponding path program 1 times [2019-02-25 15:24:26,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:26,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:26,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:26,677 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:24:26,795 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,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:26,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:26,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:26,796 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [32], [33] [2019-02-25 15:24:26,800 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:26,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:26,802 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:26,802 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:26,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:26,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:26,803 INFO 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:24:26,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:26,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:26,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:26,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:26,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:26,848 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,863 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,876 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,892 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,919 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,947 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:26,980 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:26,983 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:26,985 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:26,990 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:26,993 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:27,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:27,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:27,016 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,052 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,080 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,102 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,119 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,133 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,146 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,192 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:27,193 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:27,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,236 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:27,236 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,276 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:27,277 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:27,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:27,308 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:27,309 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:27,353 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:27,353 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:27,375 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:27,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:27,395 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:27,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:27,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:27,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:27,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:27,415 INFO L87 Difference]: Start difference. First operand 109 states and 628 transitions. Second operand 8 states. [2019-02-25 15:24:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:27,843 INFO L93 Difference]: Finished difference Result 140 states and 686 transitions. [2019-02-25 15:24:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:27,843 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:27,846 INFO L225 Difference]: With dead ends: 140 [2019-02-25 15:24:27,846 INFO L226 Difference]: Without dead ends: 139 [2019-02-25 15:24:27,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:27,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-25 15:24:27,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2019-02-25 15:24:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:24:27,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 652 transitions. [2019-02-25 15:24:27,907 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 652 transitions. Word has length 5 [2019-02-25 15:24:27,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:27,908 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 652 transitions. [2019-02-25 15:24:27,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 652 transitions. [2019-02-25 15:24:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:27,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:27,908 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:27,908 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash 29179680, now seen corresponding path program 1 times [2019-02-25 15:24:27,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:27,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:27,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:27,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:28,083 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-02-25 15:24:28,125 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:28,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:28,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:28,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:28,126 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [26], [31] [2019-02-25 15:24:28,127 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:28,127 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:28,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:28,130 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:28,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:28,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:28,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:28,131 INFO 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:24:28,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:28,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:28,161 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:28,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:28,164 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 24 treesize of output 27 [2019-02-25 15:24:28,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,169 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 27 treesize of output 33 [2019-02-25 15:24:28,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,175 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 29 treesize of output 43 [2019-02-25 15:24:28,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,183 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 31 treesize of output 57 [2019-02-25 15:24:28,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:28,195 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,203 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:28,215 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:28,216 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,256 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,287 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,312 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,332 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,347 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,361 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,417 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:28,418 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,435 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,446 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,463 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,486 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,513 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,559 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:24:28,559 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:28,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:28,621 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,661 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:28,662 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:28,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,696 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:28,697 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,740 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:28,740 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:24:28,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:28,785 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:28,786 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:28,786 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:28,824 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:28,824 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:28,845 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:28,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:28,880 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:24:28,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:28,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:28,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:28,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:28,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:28,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:28,900 INFO L87 Difference]: Start difference. First operand 112 states and 652 transitions. Second operand 10 states. [2019-02-25 15:24:29,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:29,600 INFO L93 Difference]: Finished difference Result 161 states and 770 transitions. [2019-02-25 15:24:29,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:29,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:29,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:29,602 INFO L225 Difference]: With dead ends: 161 [2019-02-25 15:24:29,602 INFO L226 Difference]: Without dead ends: 159 [2019-02-25 15:24:29,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-25 15:24:29,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2019-02-25 15:24:29,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:24:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 724 transitions. [2019-02-25 15:24:29,661 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 724 transitions. Word has length 5 [2019-02-25 15:24:29,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:29,661 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 724 transitions. [2019-02-25 15:24:29,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:29,661 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 724 transitions. [2019-02-25 15:24:29,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:29,662 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:29,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:29,662 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:29,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:29,663 INFO L82 PathProgramCache]: Analyzing trace with hash 28830064, now seen corresponding path program 1 times [2019-02-25 15:24:29,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:29,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:29,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:29,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:30,046 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:30,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:30,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:30,047 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:30,047 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [32], [33] [2019-02-25 15:24:30,049 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:30,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:30,054 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:30,055 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:30,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:30,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:30,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:30,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:30,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:30,074 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:30,094 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:30,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:30,518 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:30,518 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,792 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,868 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,897 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,931 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:30,970 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,013 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:31,016 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:31,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:31,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:31,022 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:31,026 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:31,035 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:31,036 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,073 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,101 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,123 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,140 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,153 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,166 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,212 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:31,213 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:31,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,258 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:31,258 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,298 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:31,299 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:31,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:31,359 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:31,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:31,360 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:31,401 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:31,401 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-25 15:24:31,487 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:31,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:31,509 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:31,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:31,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:31,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:31,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:31,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:31,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:31,531 INFO L87 Difference]: Start difference. First operand 121 states and 724 transitions. Second operand 8 states. [2019-02-25 15:24:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:31,940 INFO L93 Difference]: Finished difference Result 156 states and 773 transitions. [2019-02-25 15:24:31,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:31,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:31,943 INFO L225 Difference]: With dead ends: 156 [2019-02-25 15:24:31,943 INFO L226 Difference]: Without dead ends: 154 [2019-02-25 15:24:31,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:31,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-02-25 15:24:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 123. [2019-02-25 15:24:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-02-25 15:24:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 733 transitions. [2019-02-25 15:24:31,993 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 733 transitions. Word has length 5 [2019-02-25 15:24:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:31,993 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 733 transitions. [2019-02-25 15:24:31,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 733 transitions. [2019-02-25 15:24:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:31,994 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:31,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:31,994 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:31,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash 28818532, now seen corresponding path program 1 times [2019-02-25 15:24:31,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:31,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:31,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:32,051 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:32,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:32,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:32,052 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:32,052 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [32], [33] [2019-02-25 15:24:32,053 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:32,053 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:32,055 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:32,056 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:32,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:32,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:32,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:32,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:32,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:32,070 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:32,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:32,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:32,100 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,113 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,119 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,130 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,151 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,190 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,224 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:32,227 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:32,230 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:32,234 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:32,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:32,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:32,246 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:32,246 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,281 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,309 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,331 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,348 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,361 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,374 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,420 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 1 xjuncts. [2019-02-25 15:24:32,421 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:32,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,459 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:32,459 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,501 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,501 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:32,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:32,529 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:32,529 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:32,570 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:32,570 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:24:32,590 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:32,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:32,600 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:24:32,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:32,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:32,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:32,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:32,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:32,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:32,619 INFO L87 Difference]: Start difference. First operand 123 states and 733 transitions. Second operand 8 states. [2019-02-25 15:24:32,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:32,942 INFO L93 Difference]: Finished difference Result 168 states and 891 transitions. [2019-02-25 15:24:32,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:32,943 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:32,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:32,945 INFO L225 Difference]: With dead ends: 168 [2019-02-25 15:24:32,946 INFO L226 Difference]: Without dead ends: 167 [2019-02-25 15:24:32,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:32,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-25 15:24:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2019-02-25 15:24:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-25 15:24:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 865 transitions. [2019-02-25 15:24:33,014 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 865 transitions. Word has length 5 [2019-02-25 15:24:33,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:33,014 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 865 transitions. [2019-02-25 15:24:33,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:33,014 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 865 transitions. [2019-02-25 15:24:33,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:33,015 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:33,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:33,015 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:33,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:33,015 INFO L82 PathProgramCache]: Analyzing trace with hash 28818344, now seen corresponding path program 1 times [2019-02-25 15:24:33,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:33,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:33,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:33,097 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:33,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:33,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:33,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:33,098 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [26], [31] [2019-02-25 15:24:33,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:33,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:33,102 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:33,102 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:33,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:33,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:33,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:33,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:24:33,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:33,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:33,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:33,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:33,120 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 24 treesize of output 27 [2019-02-25 15:24:33,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,125 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 27 treesize of output 33 [2019-02-25 15:24:33,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,129 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 29 treesize of output 43 [2019-02-25 15:24:33,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,138 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 31 treesize of output 57 [2019-02-25 15:24:33,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:33,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:33,179 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:33,180 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,217 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,249 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,273 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,292 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,308 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,323 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,380 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:33,381 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,395 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,407 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,426 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,451 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,478 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,524 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:33,525 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:33,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,571 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:33,572 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,613 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:33,613 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:33,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:33,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,682 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:33,682 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:24:33,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:33,717 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:33,718 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:33,718 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:33,758 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:33,759 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:33,795 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:33,795 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:33,823 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:33,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:33,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:24:33,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:33,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:33,842 INFO L87 Difference]: Start difference. First operand 139 states and 865 transitions. Second operand 10 states. [2019-02-25 15:24:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:34,531 INFO L93 Difference]: Finished difference Result 242 states and 1262 transitions. [2019-02-25 15:24:34,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:24:34,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:34,534 INFO L225 Difference]: With dead ends: 242 [2019-02-25 15:24:34,534 INFO L226 Difference]: Without dead ends: 240 [2019-02-25 15:24:34,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:24:34,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-25 15:24:34,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 178. [2019-02-25 15:24:34,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:24:34,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1177 transitions. [2019-02-25 15:24:34,611 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1177 transitions. Word has length 5 [2019-02-25 15:24:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:34,611 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1177 transitions. [2019-02-25 15:24:34,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1177 transitions. [2019-02-25 15:24:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:34,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:34,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:34,612 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:34,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:34,613 INFO L82 PathProgramCache]: Analyzing trace with hash 28835830, now seen corresponding path program 1 times [2019-02-25 15:24:34,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:34,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:34,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:34,614 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:34,772 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2019-02-25 15:24:34,784 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:34,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:34,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:34,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:34,784 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [32], [33] [2019-02-25 15:24:34,785 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:34,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:34,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:34,788 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:34,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:34,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:34,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:34,789 INFO 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:24:34,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:34,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:34,806 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:34,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:34,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 24 treesize of output 27 [2019-02-25 15:24:34,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,815 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 27 treesize of output 33 [2019-02-25 15:24:34,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,822 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 29 treesize of output 43 [2019-02-25 15:24:34,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,907 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 31 treesize of output 57 [2019-02-25 15:24:34,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:34,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:35,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,133 INFO L292 Elim1Store]: Index analysis took 125 ms [2019-02-25 15:24:35,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:35,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,283 INFO L292 Elim1Store]: Index analysis took 146 ms [2019-02-25 15:24:35,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:35,284 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,408 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,440 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,466 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,486 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,503 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,517 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,587 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:35,587 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,608 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,619 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,638 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,670 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,709 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,750 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,814 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:35,815 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:24:35,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:35,845 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:35,906 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:35,907 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:35,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:35,941 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:35,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:35,943 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:36,001 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:36,002 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-25 15:24:36,023 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:36,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:36,043 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:36,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:36,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:36,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:36,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:36,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:36,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:36,062 INFO L87 Difference]: Start difference. First operand 178 states and 1177 transitions. Second operand 8 states. [2019-02-25 15:24:36,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:36,685 INFO L93 Difference]: Finished difference Result 211 states and 1231 transitions. [2019-02-25 15:24:36,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:36,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:36,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:36,688 INFO L225 Difference]: With dead ends: 211 [2019-02-25 15:24:36,688 INFO L226 Difference]: Without dead ends: 203 [2019-02-25 15:24:36,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-25 15:24:36,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 176. [2019-02-25 15:24:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-02-25 15:24:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 1188 transitions. [2019-02-25 15:24:36,809 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 1188 transitions. Word has length 5 [2019-02-25 15:24:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:36,809 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 1188 transitions. [2019-02-25 15:24:36,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 1188 transitions. [2019-02-25 15:24:36,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:36,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:36,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:36,815 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:36,816 INFO L82 PathProgramCache]: Analyzing trace with hash 28822376, now seen corresponding path program 1 times [2019-02-25 15:24:36,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:36,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:36,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:36,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:36,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:37,109 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:24:37,193 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:37,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:37,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:37,193 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:37,194 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [32], [33] [2019-02-25 15:24:37,197 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:37,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:37,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:37,199 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:37,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:37,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:37,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:37,200 INFO 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:24:37,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:37,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:37,214 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:37,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:37,218 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 24 treesize of output 27 [2019-02-25 15:24:37,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,221 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 27 treesize of output 33 [2019-02-25 15:24:37,224 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,226 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 29 treesize of output 43 [2019-02-25 15:24:37,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,231 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 31 treesize of output 57 [2019-02-25 15:24:37,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:37,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:37,262 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:37,262 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,302 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,334 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,357 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,377 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,394 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,407 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,463 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:37,463 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,479 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,495 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,512 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,533 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,560 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,606 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:37,606 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:37,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,652 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:37,652 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,692 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:37,692 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:37,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:37,722 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:37,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:37,724 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:37,763 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:37,763 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-25 15:24:37,784 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:37,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:37,806 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:37,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:37,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:37,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:37,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:37,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:37,825 INFO L87 Difference]: Start difference. First operand 176 states and 1188 transitions. Second operand 8 states. [2019-02-25 15:24:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:38,256 INFO L93 Difference]: Finished difference Result 201 states and 1233 transitions. [2019-02-25 15:24:38,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:38,256 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:38,259 INFO L225 Difference]: With dead ends: 201 [2019-02-25 15:24:38,259 INFO L226 Difference]: Without dead ends: 200 [2019-02-25 15:24:38,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-25 15:24:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 178. [2019-02-25 15:24:38,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:24:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 1204 transitions. [2019-02-25 15:24:38,331 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 1204 transitions. Word has length 5 [2019-02-25 15:24:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:38,332 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 1204 transitions. [2019-02-25 15:24:38,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:38,332 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 1204 transitions. [2019-02-25 15:24:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:38,333 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:38,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:38,333 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash 29302192, now seen corresponding path program 1 times [2019-02-25 15:24:38,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:38,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:38,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:38,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:38,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:38,398 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,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:38,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:38,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:38,399 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [31] [2019-02-25 15:24:38,400 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:38,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:38,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:38,403 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:38,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:38,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:38,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:38,404 INFO 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:24:38,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:38,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:38,419 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:38,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:38,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:24:38,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,426 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 27 treesize of output 33 [2019-02-25 15:24:38,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,432 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 29 treesize of output 43 [2019-02-25 15:24:38,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:38,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,445 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:38,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:38,457 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:38,467 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:38,467 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,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:38,544 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,569 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,587 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,604 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,619 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,711 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:38,712 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,989 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:38,999 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,016 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,039 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,066 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,112 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:24:39,113 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:39,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:39,166 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,207 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:39,207 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:39,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,241 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:39,242 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,280 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:39,280 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:24:39,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:39,314 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:39,314 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:39,315 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:39,352 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:39,353 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:39,375 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:39,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:39,415 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:24:39,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:39,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:39,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:39,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:39,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:39,435 INFO L87 Difference]: Start difference. First operand 178 states and 1204 transitions. Second operand 10 states. [2019-02-25 15:24:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:40,188 INFO L93 Difference]: Finished difference Result 245 states and 1358 transitions. [2019-02-25 15:24:40,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:40,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:40,191 INFO L225 Difference]: With dead ends: 245 [2019-02-25 15:24:40,191 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:24:40,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 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:24:40,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:24:40,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2019-02-25 15:24:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-25 15:24:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1287 transitions. [2019-02-25 15:24:40,280 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1287 transitions. Word has length 5 [2019-02-25 15:24:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:40,280 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1287 transitions. [2019-02-25 15:24:40,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1287 transitions. [2019-02-25 15:24:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:40,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:40,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:40,281 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash 29295188, now seen corresponding path program 1 times [2019-02-25 15:24:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:40,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:40,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:40,440 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2019-02-25 15:24:40,451 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:40,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:40,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:40,452 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:40,452 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [32], [33] [2019-02-25 15:24:40,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:40,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:40,454 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:40,455 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:40,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:40,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:40,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:40,455 INFO 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:24:40,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:40,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:40,472 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:40,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:40,499 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:40,499 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,514 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,524 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,542 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,569 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,597 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:24:40,636 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:40,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:40,642 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:40,646 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:40,665 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:40,697 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:40,698 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,735 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,762 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,784 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,801 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,815 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,828 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,874 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 1 xjuncts. [2019-02-25 15:24:40,874 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:40,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,928 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:40,929 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:40,968 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:40,969 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:40,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:40,994 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:40,995 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:41,035 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:41,035 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:24:41,054 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:41,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:41,060 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:24:41,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:41,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2019-02-25 15:24:41,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:41,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:24:41,079 INFO L87 Difference]: Start difference. First operand 191 states and 1287 transitions. Second operand 8 states. [2019-02-25 15:24:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:41,435 INFO L93 Difference]: Finished difference Result 343 states and 2333 transitions. [2019-02-25 15:24:41,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:41,435 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:41,439 INFO L225 Difference]: With dead ends: 343 [2019-02-25 15:24:41,439 INFO L226 Difference]: Without dead ends: 342 [2019-02-25 15:24:41,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:24:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-02-25 15:24:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 304. [2019-02-25 15:24:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-25 15:24:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 2201 transitions. [2019-02-25 15:24:41,559 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 2201 transitions. Word has length 5 [2019-02-25 15:24:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:41,559 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 2201 transitions. [2019-02-25 15:24:41,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 2201 transitions. [2019-02-25 15:24:41,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:41,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:41,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:41,560 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:41,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:41,561 INFO L82 PathProgramCache]: Analyzing trace with hash 29295000, now seen corresponding path program 1 times [2019-02-25 15:24:41,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:41,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:41,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:41,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:41,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:41,926 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-02-25 15:24:41,962 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:41,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:41,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:41,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:41,962 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [26], [31] [2019-02-25 15:24:41,963 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:41,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:41,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:41,966 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:41,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:41,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:41,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:41,967 INFO 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:24:41,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:41,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:41,983 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:41,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:41,987 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:24:41,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:41,992 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 27 treesize of output 33 [2019-02-25 15:24:41,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:41,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:41,997 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 29 treesize of output 43 [2019-02-25 15:24:42,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,004 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 31 treesize of output 57 [2019-02-25 15:24:42,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,013 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:42,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,023 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:42,035 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:42,036 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,076 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,108 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,133 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,153 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,169 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,184 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,239 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:42,239 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,254 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,260 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,274 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,293 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,320 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,366 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:24:42,366 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:42,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:42,438 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,478 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:42,478 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:42,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,509 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:42,510 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,549 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:42,549 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:24:42,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:42,587 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:42,588 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:24:42,589 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:42,628 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:42,629 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:24:42,650 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:42,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:42,687 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:24:42,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:42,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:24:42,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:42,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:42,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:42,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:42,705 INFO L87 Difference]: Start difference. First operand 304 states and 2201 transitions. Second operand 10 states. [2019-02-25 15:24:44,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:44,319 INFO L93 Difference]: Finished difference Result 369 states and 2390 transitions. [2019-02-25 15:24:44,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:24:44,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:44,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:44,324 INFO L225 Difference]: With dead ends: 369 [2019-02-25 15:24:44,324 INFO L226 Difference]: Without dead ends: 367 [2019-02-25 15:24:44,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:24:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-02-25 15:24:44,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 320. [2019-02-25 15:24:44,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-02-25 15:24:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 2329 transitions. [2019-02-25 15:24:44,453 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 2329 transitions. Word has length 5 [2019-02-25 15:24:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:44,453 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 2329 transitions. [2019-02-25 15:24:44,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 2329 transitions. [2019-02-25 15:24:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:44,454 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:44,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:44,455 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 29312486, now seen corresponding path program 1 times [2019-02-25 15:24:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:44,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:44,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:44,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:44,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:44,534 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:44,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:44,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:44,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:44,534 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [32], [33] [2019-02-25 15:24:44,535 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:44,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:44,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:44,537 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:44,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:44,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:44,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:44,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 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:24:44,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:44,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:44,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:44,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:44,639 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:44,640 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,668 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,679 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,700 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,731 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,765 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,816 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,875 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:44,877 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:44,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:44,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:44,885 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:44,888 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:44,891 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:44,892 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,941 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,969 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:44,997 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,015 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,030 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,043 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,107 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,107 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:24:45,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:45,136 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,196 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,197 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:45,224 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:45,231 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:45,232 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:45,233 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:45,290 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:45,291 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-25 15:24:45,322 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:45,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:45,344 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:45,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:45,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:45,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:45,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:45,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:45,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:45,364 INFO L87 Difference]: Start difference. First operand 320 states and 2329 transitions. Second operand 8 states. [2019-02-25 15:24:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:45,994 INFO L93 Difference]: Finished difference Result 354 states and 2377 transitions. [2019-02-25 15:24:45,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:45,995 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:46,000 INFO L225 Difference]: With dead ends: 354 [2019-02-25 15:24:46,000 INFO L226 Difference]: Without dead ends: 350 [2019-02-25 15:24:46,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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:24:46,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-02-25 15:24:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 323. [2019-02-25 15:24:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-02-25 15:24:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 2346 transitions. [2019-02-25 15:24:46,121 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 2346 transitions. Word has length 5 [2019-02-25 15:24:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:46,121 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 2346 transitions. [2019-02-25 15:24:46,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 2346 transitions. [2019-02-25 15:24:46,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:46,122 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:46,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:46,122 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:46,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:46,122 INFO L82 PathProgramCache]: Analyzing trace with hash 29299032, now seen corresponding path program 1 times [2019-02-25 15:24:46,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:46,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:46,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:46,180 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:46,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:46,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:46,181 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:46,181 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [32], [33] [2019-02-25 15:24:46,182 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:46,182 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:46,184 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:46,184 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:46,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:46,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:46,185 INFO 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:24:46,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:46,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:46,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:24:46,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:46,236 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 24 treesize of output 27 [2019-02-25 15:24:46,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,271 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 27 treesize of output 33 [2019-02-25 15:24:46,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,276 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 29 treesize of output 43 [2019-02-25 15:24:46,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,282 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,285 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 31 treesize of output 57 [2019-02-25 15:24:46,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:46,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:46,315 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:46,316 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,356 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,385 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,410 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,430 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,445 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,460 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,517 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:46,517 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,530 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,537 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,549 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,566 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,594 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,640 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:46,640 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:46,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,683 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:46,683 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,724 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:46,724 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:46,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:46,763 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:46,763 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:46,764 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:46,802 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:46,802 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-25 15:24:46,821 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:46,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:46,842 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:46,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:46,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:24:46,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:46,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:46,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:46,861 INFO L87 Difference]: Start difference. First operand 323 states and 2346 transitions. Second operand 8 states. [2019-02-25 15:24:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:47,460 INFO L93 Difference]: Finished difference Result 347 states and 2375 transitions. [2019-02-25 15:24:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:24:47,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:47,465 INFO L225 Difference]: With dead ends: 347 [2019-02-25 15:24:47,466 INFO L226 Difference]: Without dead ends: 346 [2019-02-25 15:24:47,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:24:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-02-25 15:24:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 324. [2019-02-25 15:24:47,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-25 15:24:47,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-25 15:24:47,619 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-25 15:24:47,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:47,620 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-25 15:24:47,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:47,620 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-25 15:24:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:47,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:47,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:47,621 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash 28958902, now seen corresponding path program 1 times [2019-02-25 15:24:47,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:47,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:47,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:47,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:47,786 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:24:47,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:47,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:47,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:47,786 INFO L207 CegarAbsIntRunner]: [0], [10], [32], [34], [35] [2019-02-25 15:24:47,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:47,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:47,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:47,789 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:24:47,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:47,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:47,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:47,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 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:24:47,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:47,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:47,812 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:24:47,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:47,863 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:47,864 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,885 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,896 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,911 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,938 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:47,979 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,022 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:24:48,028 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:24:48,030 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:24:48,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:24:48,036 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:48,039 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:48,048 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:48,048 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,085 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,113 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,135 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,152 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,166 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,180 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,226 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 1 xjuncts. [2019-02-25 15:24:48,226 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:48,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:48,274 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:24:48,275 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:48,317 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:48,317 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:24:48,337 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:24:48,337 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:48,346 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:24:48,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:48,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:24:48,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:48,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:24:48,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:24:48,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:24:48,365 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 6 states. [2019-02-25 15:24:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:48,680 INFO L93 Difference]: Finished difference Result 344 states and 2373 transitions. [2019-02-25 15:24:48,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:24:48,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-25 15:24:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:48,686 INFO L225 Difference]: With dead ends: 344 [2019-02-25 15:24:48,686 INFO L226 Difference]: Without dead ends: 343 [2019-02-25 15:24:48,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:24:48,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-02-25 15:24:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 324. [2019-02-25 15:24:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-02-25 15:24:48,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 2354 transitions. [2019-02-25 15:24:48,805 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 2354 transitions. Word has length 5 [2019-02-25 15:24:48,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:48,805 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 2354 transitions. [2019-02-25 15:24:48,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:24:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 2354 transitions. [2019-02-25 15:24:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:48,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:48,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:48,806 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:48,806 INFO L82 PathProgramCache]: Analyzing trace with hash 28945258, now seen corresponding path program 1 times [2019-02-25 15:24:48,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:48,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:48,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:48,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:49,162 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-02-25 15:24:49,286 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-25 15:24:49,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:24:49,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:49,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:49,313 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:49,313 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [31] [2019-02-25 15:24:49,314 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:49,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:49,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:49,317 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:49,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:49,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:49,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 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:24:49,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:49,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:49,354 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:49,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:49,370 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 24 treesize of output 27 [2019-02-25 15:24:49,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,381 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 27 treesize of output 33 [2019-02-25 15:24:49,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,385 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 29 treesize of output 43 [2019-02-25 15:24:49,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,392 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 31 treesize of output 57 [2019-02-25 15:24:49,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,400 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:49,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,408 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:49,418 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:49,419 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,456 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,488 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,513 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,532 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,546 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,560 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,615 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:49,615 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,633 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,649 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,668 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,689 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,716 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:49,763 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:24:49,763 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:49,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:49,807 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:24:49,808 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:49,954 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:49,954 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-25 15:24:50,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,027 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:50,036 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 106 [2019-02-25 15:24:50,037 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:50,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,223 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:50,224 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 117 [2019-02-25 15:24:50,224 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:50,370 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-25 15:24:50,370 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:191 [2019-02-25 15:24:50,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,459 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,461 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,462 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,463 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,504 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 140 [2019-02-25 15:24:50,508 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:24:50,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:50,974 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:50,975 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 97 [2019-02-25 15:24:50,975 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:51,170 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:24:51,171 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-25 15:24:53,425 WARN L181 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-25 15:24:53,427 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:53,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:53,474 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:24:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:24:53,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:53,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:24:53,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:24:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:24:53,493 INFO L87 Difference]: Start difference. First operand 324 states and 2354 transitions. Second operand 10 states. [2019-02-25 15:24:53,675 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-02-25 15:24:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:55,740 INFO L93 Difference]: Finished difference Result 434 states and 2876 transitions. [2019-02-25 15:24:55,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:24:55,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:24:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:55,745 INFO L225 Difference]: With dead ends: 434 [2019-02-25 15:24:55,745 INFO L226 Difference]: Without dead ends: 432 [2019-02-25 15:24:55,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:24:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-02-25 15:24:55,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 339. [2019-02-25 15:24:55,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-02-25 15:24:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 2453 transitions. [2019-02-25 15:24:55,872 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 2453 transitions. Word has length 5 [2019-02-25 15:24:55,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:55,872 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 2453 transitions. [2019-02-25 15:24:55,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:24:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 2453 transitions. [2019-02-25 15:24:55,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:55,873 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:55,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:55,874 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:55,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:55,874 INFO L82 PathProgramCache]: Analyzing trace with hash 28933852, now seen corresponding path program 2 times [2019-02-25 15:24:55,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:55,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:55,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:55,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:55,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:56,007 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-02-25 15:24:56,017 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:56,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:56,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:56,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:24:56,017 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:56,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:56,018 INFO 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:24:56,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:24:56,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:24:56,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:24:56,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:24:56,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:24:56,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:56,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:24:56,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,048 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 27 treesize of output 33 [2019-02-25 15:24:56,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,053 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 29 treesize of output 43 [2019-02-25 15:24:56,057 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,059 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 31 treesize of output 57 [2019-02-25 15:24:56,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:56,079 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,080 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,083 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:56,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:24:56,097 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,152 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,183 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,205 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,225 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,242 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,257 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,325 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:24:56,326 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,662 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,672 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,690 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,711 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,739 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,780 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,845 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 1 xjuncts. [2019-02-25 15:24:56,845 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-02-25 15:24:56,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,867 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:24:56,867 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:56,930 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:56,931 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:24:56,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:56,958 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:24:56,959 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:57,018 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:24:57,018 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:24:57,036 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:57,036 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:24:57,049 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:24:57,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:24:57,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:24:57,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:24:57,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:24:57,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:24:57,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:24:57,067 INFO L87 Difference]: Start difference. First operand 339 states and 2453 transitions. Second operand 8 states. [2019-02-25 15:24:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:24:58,241 INFO L93 Difference]: Finished difference Result 472 states and 3201 transitions. [2019-02-25 15:24:58,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:24:58,241 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:24:58,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:24:58,247 INFO L225 Difference]: With dead ends: 472 [2019-02-25 15:24:58,247 INFO L226 Difference]: Without dead ends: 471 [2019-02-25 15:24:58,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:24:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-02-25 15:24:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 396. [2019-02-25 15:24:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-02-25 15:24:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 2917 transitions. [2019-02-25 15:24:58,400 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 2917 transitions. Word has length 5 [2019-02-25 15:24:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:24:58,400 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 2917 transitions. [2019-02-25 15:24:58,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:24:58,400 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 2917 transitions. [2019-02-25 15:24:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:24:58,402 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:24:58,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:24:58,402 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:24:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash 28952946, now seen corresponding path program 1 times [2019-02-25 15:24:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:24:58,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:58,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:24:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:24:58,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:24:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:58,568 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 17 [2019-02-25 15:24:58,646 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:58,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:58,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:24:58,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:24:58,646 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [28], [31] [2019-02-25 15:24:58,648 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:24:58,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:24:58,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:24:58,650 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:58,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:24:58,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:24:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:24:58,650 INFO 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:24:58,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:24:58,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:24:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:24:58,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:24:58,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:24:58,706 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 24 treesize of output 27 [2019-02-25 15:24:58,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,710 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 27 treesize of output 33 [2019-02-25 15:24:58,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,714 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 29 treesize of output 43 [2019-02-25 15:24:58,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,722 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 31 treesize of output 57 [2019-02-25 15:24:58,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,735 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:24:58,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:58,746 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:24:58,757 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:24:58,757 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,798 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,829 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,854 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,873 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,889 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,904 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,959 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:24:58,960 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,975 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:58,985 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,001 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,026 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,053 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,099 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:24:59,100 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:24:59,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,142 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:24:59,143 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:59,289 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:59,290 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-02-25 15:24:59,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,342 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:59,342 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 109 [2019-02-25 15:24:59,343 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:24:59,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,457 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:24:59,465 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 114 [2019-02-25 15:24:59,466 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:24:59,643 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-02-25 15:24:59,644 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:191 [2019-02-25 15:24:59,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:24:59,772 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 124 [2019-02-25 15:24:59,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:25:00,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:00,164 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:00,165 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 101 [2019-02-25 15:25:00,165 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:00,350 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:25:00,350 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-02-25 15:25:00,581 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-02-25 15:25:00,582 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:00,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:00,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:25:00,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:00,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:25:00,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:00,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:00,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:00,649 INFO L87 Difference]: Start difference. First operand 396 states and 2917 transitions. Second operand 10 states. [2019-02-25 15:25:01,002 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 88 [2019-02-25 15:25:02,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:02,663 INFO L93 Difference]: Finished difference Result 485 states and 3298 transitions. [2019-02-25 15:25:02,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:25:02,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:02,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:02,670 INFO L225 Difference]: With dead ends: 485 [2019-02-25 15:25:02,670 INFO L226 Difference]: Without dead ends: 484 [2019-02-25 15:25:02,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-02-25 15:25:02,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2019-02-25 15:25:02,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2019-02-25 15:25:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 2949 transitions. [2019-02-25 15:25:02,864 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 2949 transitions. Word has length 5 [2019-02-25 15:25:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:02,864 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 2949 transitions. [2019-02-25 15:25:02,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 2949 transitions. [2019-02-25 15:25:02,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:02,865 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:02,866 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:02,866 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:02,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:02,866 INFO L82 PathProgramCache]: Analyzing trace with hash 28954558, now seen corresponding path program 2 times [2019-02-25 15:25:02,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:02,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:02,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:02,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:02,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:02,985 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:02,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:02,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:02,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:02,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:25:02,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:02,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:25:02,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:02,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:03,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:25:03,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:03,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:25:03,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:03,008 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 24 treesize of output 27 [2019-02-25 15:25:03,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:03,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,017 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 29 treesize of output 43 [2019-02-25 15:25:03,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,025 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 31 treesize of output 57 [2019-02-25 15:25:03,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,030 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,033 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:03,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:03,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:03,055 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,112 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,143 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,176 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,196 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,214 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,230 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:03,300 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,320 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,332 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,350 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,375 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,414 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,455 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,519 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:25:03,520 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:03,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,558 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:03,558 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,620 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:03,620 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:03,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,655 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,658 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:03,659 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,716 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:03,716 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:03,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:03,762 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:03,762 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:03,763 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:03,820 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:03,820 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:25:03,847 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:03,848 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:03,883 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:25:03,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:03,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:03,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:03,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:03,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:03,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:03,903 INFO L87 Difference]: Start difference. First operand 400 states and 2949 transitions. Second operand 10 states. [2019-02-25 15:25:04,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:04,846 INFO L93 Difference]: Finished difference Result 485 states and 3293 transitions. [2019-02-25 15:25:04,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:04,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:04,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:04,853 INFO L225 Difference]: With dead ends: 485 [2019-02-25 15:25:04,853 INFO L226 Difference]: Without dead ends: 480 [2019-02-25 15:25:04,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:04,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-02-25 15:25:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 435. [2019-02-25 15:25:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-02-25 15:25:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 3230 transitions. [2019-02-25 15:25:05,017 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 3230 transitions. Word has length 5 [2019-02-25 15:25:05,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:05,018 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 3230 transitions. [2019-02-25 15:25:05,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:05,018 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 3230 transitions. [2019-02-25 15:25:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:05,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:05,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:05,020 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash 28954806, now seen corresponding path program 2 times [2019-02-25 15:25:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:05,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:05,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:05,172 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:25:05,337 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:05,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:05,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:05,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:05,338 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:05,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:05,338 INFO 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:25:05,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:05,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:05,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:25:05,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:05,356 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:25:05,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:05,360 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 24 treesize of output 27 [2019-02-25 15:25:05,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,363 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 27 treesize of output 33 [2019-02-25 15:25:05,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,370 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 29 treesize of output 43 [2019-02-25 15:25:05,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,377 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 31 treesize of output 57 [2019-02-25 15:25:05,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:05,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:05,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,405 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:05,405 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,459 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,491 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,514 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,535 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,551 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,566 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,636 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:05,636 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,660 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,674 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,692 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,711 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,743 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,784 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,852 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:25:05,852 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:05,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:05,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:05,891 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:05,951 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:05,952 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:06,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:06,021 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,081 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,082 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:06,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:06,127 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:06,127 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:06,128 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:06,183 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:06,184 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:25:06,208 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:06,208 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:06,249 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:25:06,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:06,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:06,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:06,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:06,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:06,268 INFO L87 Difference]: Start difference. First operand 435 states and 3230 transitions. Second operand 10 states. [2019-02-25 15:25:07,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:07,036 INFO L93 Difference]: Finished difference Result 501 states and 3456 transitions. [2019-02-25 15:25:07,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:07,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:07,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:07,043 INFO L225 Difference]: With dead ends: 501 [2019-02-25 15:25:07,043 INFO L226 Difference]: Without dead ends: 499 [2019-02-25 15:25:07,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-02-25 15:25:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 457. [2019-02-25 15:25:07,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2019-02-25 15:25:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 3406 transitions. [2019-02-25 15:25:07,193 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 3406 transitions. Word has length 5 [2019-02-25 15:25:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:07,193 INFO L480 AbstractCegarLoop]: Abstraction has 457 states and 3406 transitions. [2019-02-25 15:25:07,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 3406 transitions. [2019-02-25 15:25:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:07,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:07,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:07,194 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:07,195 INFO L82 PathProgramCache]: Analyzing trace with hash 28941104, now seen corresponding path program 1 times [2019-02-25 15:25:07,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:07,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:07,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:07,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:07,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:07,287 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:07,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:07,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:07,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:07,287 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [31] [2019-02-25 15:25:07,288 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:07,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:07,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:07,290 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:07,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:07,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:07,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:07,291 INFO 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:25:07,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:07,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:07,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:25:07,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:07,316 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 24 treesize of output 27 [2019-02-25 15:25:07,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,318 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 27 treesize of output 33 [2019-02-25 15:25:07,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,325 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 29 treesize of output 43 [2019-02-25 15:25:07,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,332 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 31 treesize of output 57 [2019-02-25 15:25:07,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:07,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,351 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:07,365 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:07,366 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,405 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,436 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,461 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,479 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,496 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,511 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,570 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:07,571 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,583 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,589 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,600 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,617 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,653 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,699 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:25:07,699 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:07,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,798 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:07,798 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,840 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:07,840 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:07,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,871 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:07,872 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,910 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:07,910 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:07,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:07,946 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:07,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:07,947 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:07,983 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:07,983 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:08,004 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:08,004 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:08,041 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:25:08,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:08,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:08,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:08,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:08,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:08,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:08,061 INFO L87 Difference]: Start difference. First operand 457 states and 3406 transitions. Second operand 10 states. [2019-02-25 15:25:08,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:08,961 INFO L93 Difference]: Finished difference Result 539 states and 3726 transitions. [2019-02-25 15:25:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:08,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:08,969 INFO L225 Difference]: With dead ends: 539 [2019-02-25 15:25:08,969 INFO L226 Difference]: Without dead ends: 537 [2019-02-25 15:25:08,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:08,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-02-25 15:25:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 492. [2019-02-25 15:25:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2019-02-25 15:25:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 3666 transitions. [2019-02-25 15:25:09,133 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 3666 transitions. Word has length 5 [2019-02-25 15:25:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:09,133 INFO L480 AbstractCegarLoop]: Abstraction has 492 states and 3666 transitions. [2019-02-25 15:25:09,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 3666 transitions. [2019-02-25 15:25:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:09,135 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:09,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:09,135 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:09,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:09,136 INFO L82 PathProgramCache]: Analyzing trace with hash 28941352, now seen corresponding path program 1 times [2019-02-25 15:25:09,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:09,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:09,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:09,137 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:09,226 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:09,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:09,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:09,226 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:09,227 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [26], [31] [2019-02-25 15:25:09,227 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:09,227 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:09,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:09,230 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:09,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:09,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:09,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:09,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 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:25:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:09,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:09,249 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:25:09,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:09,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:09,284 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,298 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,312 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,328 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,353 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,381 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,415 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:09,419 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:09,421 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:09,423 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:09,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:09,428 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:09,437 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:09,438 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,475 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,503 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,525 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,542 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,556 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,570 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,616 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:25:09,616 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:09,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,681 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:09,681 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,723 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:09,724 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:09,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,772 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:09,772 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,812 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:09,812 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:09,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:09,850 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:09,851 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:09,852 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:09,889 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:09,889 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:09,913 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:09,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:09,952 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:25:09,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:09,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:09,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:09,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:09,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:09,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:09,970 INFO L87 Difference]: Start difference. First operand 492 states and 3666 transitions. Second operand 10 states. [2019-02-25 15:25:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:10,722 INFO L93 Difference]: Finished difference Result 551 states and 3869 transitions. [2019-02-25 15:25:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:10,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:25:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:10,729 INFO L225 Difference]: With dead ends: 551 [2019-02-25 15:25:10,729 INFO L226 Difference]: Without dead ends: 549 [2019-02-25 15:25:10,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-02-25 15:25:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 509. [2019-02-25 15:25:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:25:10,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3822 transitions. [2019-02-25 15:25:10,888 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3822 transitions. Word has length 5 [2019-02-25 15:25:10,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:10,888 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3822 transitions. [2019-02-25 15:25:10,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:10,888 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3822 transitions. [2019-02-25 15:25:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:10,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:10,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:10,890 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash 29435558, now seen corresponding path program 1 times [2019-02-25 15:25:10,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:10,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:10,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:10,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:10,936 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:25:10,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:10,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:10,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:10,936 INFO L207 CegarAbsIntRunner]: [0], [26], [32], [34], [35] [2019-02-25 15:25:10,937 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:10,937 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:10,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:10,939 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:25:10,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:10,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:10,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:10,940 INFO 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:25:10,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:10,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:10,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:25:10,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:11,195 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 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:11,195 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,209 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,225 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,247 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,271 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,301 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 24 treesize of output 27 [2019-02-25 15:25:11,304 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 27 treesize of output 33 [2019-02-25 15:25:11,308 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:25:11,313 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-25 15:25:11,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:25:11,323 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:25:11,332 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:25:11,333 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,365 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,390 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,408 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,423 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,437 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,450 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:11,491 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 1 xjuncts. [2019-02-25 15:25:11,492 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-02-25 15:25:13,537 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-02-25 15:25:13,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:13,545 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:25:13,545 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:13,582 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:13,582 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-25 15:25:13,605 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:25:13,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:13,614 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:25:13,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:13,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:25:13,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:13,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:25:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:25:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:25:13,633 INFO L87 Difference]: Start difference. First operand 509 states and 3822 transitions. Second operand 6 states. [2019-02-25 15:25:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:14,013 INFO L93 Difference]: Finished difference Result 523 states and 3832 transitions. [2019-02-25 15:25:14,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:25:14,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-25 15:25:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:14,019 INFO L225 Difference]: With dead ends: 523 [2019-02-25 15:25:14,019 INFO L226 Difference]: Without dead ends: 522 [2019-02-25 15:25:14,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:25:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-02-25 15:25:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 509. [2019-02-25 15:25:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:25:14,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3821 transitions. [2019-02-25 15:25:14,186 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3821 transitions. Word has length 5 [2019-02-25 15:25:14,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:14,186 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3821 transitions. [2019-02-25 15:25:14,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:25:14,187 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3821 transitions. [2019-02-25 15:25:14,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:14,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:14,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:14,188 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:14,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:14,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29425884, now seen corresponding path program 1 times [2019-02-25 15:25:14,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:14,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:14,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:14,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:14,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:14,252 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:25:14,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:14,252 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:14,253 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:14,253 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [32], [33] [2019-02-25 15:25:14,253 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:14,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:14,255 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:14,255 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:25:14,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:14,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:14,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:14,255 INFO 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:25:14,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:14,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:14,269 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:14,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:14,362 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:14,363 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,377 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,386 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,403 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,430 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,456 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,488 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:14,491 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:14,493 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:14,495 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:14,498 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:14,501 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:14,509 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:14,509 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,546 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,574 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,595 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,613 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,627 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,640 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,686 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:14,686 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:14,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,771 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:14,771 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,811 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:14,811 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:14,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:14,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:14,867 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:14,905 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:14,906 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:14,926 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:25:14,926 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:14,947 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:25:14,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:14,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:25:14,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:14,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:14,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:14,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:25:14,967 INFO L87 Difference]: Start difference. First operand 509 states and 3821 transitions. Second operand 8 states. [2019-02-25 15:25:15,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:15,621 INFO L93 Difference]: Finished difference Result 542 states and 3850 transitions. [2019-02-25 15:25:15,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:25:15,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:25:15,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:15,626 INFO L225 Difference]: With dead ends: 542 [2019-02-25 15:25:15,626 INFO L226 Difference]: Without dead ends: 540 [2019-02-25 15:25:15,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:15,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-02-25 15:25:15,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 509. [2019-02-25 15:25:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:25:15,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3820 transitions. [2019-02-25 15:25:15,788 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3820 transitions. Word has length 5 [2019-02-25 15:25:15,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:15,788 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3820 transitions. [2019-02-25 15:25:15,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:25:15,788 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3820 transitions. [2019-02-25 15:25:15,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:15,789 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:15,789 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:15,789 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:15,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:15,790 INFO L82 PathProgramCache]: Analyzing trace with hash 29431650, now seen corresponding path program 1 times [2019-02-25 15:25:15,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:15,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:15,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:15,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:15,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:15,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:15,845 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:25:15,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:15,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:15,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:15,846 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [32], [33] [2019-02-25 15:25:15,846 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:15,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:15,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:15,849 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:25:15,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:15,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:15,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:15,849 INFO 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:25:15,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:15,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:15,865 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:25:15,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:15,870 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 24 treesize of output 27 [2019-02-25 15:25:15,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,874 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 27 treesize of output 33 [2019-02-25 15:25:15,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,879 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 29 treesize of output 43 [2019-02-25 15:25:15,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,888 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 31 treesize of output 57 [2019-02-25 15:25:15,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:15,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:15,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:15,916 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:15,917 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:15,987 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,019 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,042 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,061 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,078 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,093 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,164 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:16,165 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,185 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,197 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,219 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,251 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,285 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,326 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,402 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:16,402 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:16,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,430 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:16,430 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,491 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:16,491 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:16,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:16,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:16,528 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:16,586 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:16,586 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:16,621 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:25:16,621 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:16,642 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:25:16,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:16,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:25:16,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:16,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:16,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:16,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:25:16,661 INFO L87 Difference]: Start difference. First operand 509 states and 3820 transitions. Second operand 8 states. [2019-02-25 15:25:17,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:17,399 INFO L93 Difference]: Finished difference Result 541 states and 3851 transitions. [2019-02-25 15:25:17,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:25:17,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:25:17,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:17,403 INFO L225 Difference]: With dead ends: 541 [2019-02-25 15:25:17,403 INFO L226 Difference]: Without dead ends: 540 [2019-02-25 15:25:17,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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:25:17,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-02-25 15:25:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 509. [2019-02-25 15:25:17,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-02-25 15:25:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 3820 transitions. [2019-02-25 15:25:17,571 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 3820 transitions. Word has length 5 [2019-02-25 15:25:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:17,572 INFO L480 AbstractCegarLoop]: Abstraction has 509 states and 3820 transitions. [2019-02-25 15:25:17,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:25:17,572 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 3820 transitions. [2019-02-25 15:25:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:17,573 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:17,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:17,574 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:17,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:17,574 INFO L82 PathProgramCache]: Analyzing trace with hash 29418196, now seen corresponding path program 1 times [2019-02-25 15:25:17,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:17,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:17,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:17,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:17,678 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:25:17,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:17,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:17,678 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:17,678 INFO L207 CegarAbsIntRunner]: [0], [14], [26], [32], [33] [2019-02-25 15:25:17,679 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:17,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:17,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:17,681 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:25:17,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:17,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:17,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:17,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 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:25:17,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:17,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:17,695 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:25:17,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:17,723 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:17,723 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,741 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,755 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,772 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,793 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,820 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,854 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:17,857 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:17,860 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:17,863 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:17,865 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:17,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:17,885 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:17,886 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,921 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,947 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,969 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,986 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:17,999 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,011 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,057 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:18,057 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:18,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,102 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:18,103 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,144 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:18,145 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:18,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:18,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:18,178 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:18,219 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:18,219 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:18,241 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:25:18,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:18,265 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:25:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:18,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:25:18,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:18,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:18,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:18,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:25:18,284 INFO L87 Difference]: Start difference. First operand 509 states and 3820 transitions. Second operand 8 states. [2019-02-25 15:25:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:18,908 INFO L93 Difference]: Finished difference Result 573 states and 3948 transitions. [2019-02-25 15:25:18,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:18,908 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:25:18,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:18,912 INFO L225 Difference]: With dead ends: 573 [2019-02-25 15:25:18,912 INFO L226 Difference]: Without dead ends: 572 [2019-02-25 15:25:18,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:25:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-02-25 15:25:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 517. [2019-02-25 15:25:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2019-02-25 15:25:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 3892 transitions. [2019-02-25 15:25:19,087 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 3892 transitions. Word has length 5 [2019-02-25 15:25:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:19,087 INFO L480 AbstractCegarLoop]: Abstraction has 517 states and 3892 transitions. [2019-02-25 15:25:19,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:25:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 3892 transitions. [2019-02-25 15:25:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:25:19,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:19,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:25:19,089 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash 29477778, now seen corresponding path program 1 times [2019-02-25 15:25:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:19,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:19,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:19,168 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:25:19,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:19,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:19,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:25:19,169 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [32], [33] [2019-02-25 15:25:19,170 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:19,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:19,174 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:19,174 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:25:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:19,174 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:19,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:19,175 INFO 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:25:19,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:19,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:19,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:25:19,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:19,259 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:19,260 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,290 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,311 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,339 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,368 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,415 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,466 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:19,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:19,531 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:19,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:19,536 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:19,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:19,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:19,543 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,592 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,620 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,642 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,660 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,674 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,688 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,751 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:19,752 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:19,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:19,781 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,841 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:19,841 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:19,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:19,875 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:19,876 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:19,876 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:19,933 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:19,933 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:80 [2019-02-25 15:25:19,965 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:25:19,965 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:19,988 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:25:20,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:20,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:25:20,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:20,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:25:20,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:25:20,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:25:20,007 INFO L87 Difference]: Start difference. First operand 517 states and 3892 transitions. Second operand 8 states. [2019-02-25 15:25:20,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:20,606 INFO L93 Difference]: Finished difference Result 560 states and 3946 transitions. [2019-02-25 15:25:20,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:20,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:25:20,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:20,610 INFO L225 Difference]: With dead ends: 560 [2019-02-25 15:25:20,611 INFO L226 Difference]: Without dead ends: 557 [2019-02-25 15:25:20,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:25:20,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-02-25 15:25:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 522. [2019-02-25 15:25:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2019-02-25 15:25:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 3906 transitions. [2019-02-25 15:25:20,768 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 3906 transitions. Word has length 5 [2019-02-25 15:25:20,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:20,769 INFO L480 AbstractCegarLoop]: Abstraction has 522 states and 3906 transitions. [2019-02-25 15:25:20,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:25:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 3906 transitions. [2019-02-25 15:25:20,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:20,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:20,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:20,770 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:20,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash 905114198, now seen corresponding path program 1 times [2019-02-25 15:25:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:20,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:20,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:20,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:20,809 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:25:20,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:20,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:20,810 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:20,810 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [36], [37] [2019-02-25 15:25:20,810 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:20,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:20,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:20,812 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:25:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:20,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:20,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:20,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 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:25:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:20,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:20,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:25:20,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:20,831 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 24 treesize of output 27 [2019-02-25 15:25:20,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,838 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 27 treesize of output 33 [2019-02-25 15:25:20,842 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:25:20,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,852 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 31 treesize of output 49 [2019-02-25 15:25:20,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,862 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:25:20,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:20,873 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:25:20,884 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:25:20,885 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:20,919 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:20,946 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:20,968 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:20,984 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:20,998 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,013 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,102 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 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:21,102 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,114 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,124 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,140 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,163 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:21,203 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:21,203 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:84, output treesize:88 [2019-02-25 15:25:23,267 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-02-25 15:25:23,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:23,362 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:25:23,363 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:23,572 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:23,573 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-02-25 15:25:23,590 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:25:23,590 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:23,593 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:25:23,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:25:23,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:25:23,612 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:25:23,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:25:23,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:25:23,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:25:23,612 INFO L87 Difference]: Start difference. First operand 522 states and 3906 transitions. Second operand 4 states. [2019-02-25 15:25:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:23,940 INFO L93 Difference]: Finished difference Result 806 states and 6051 transitions. [2019-02-25 15:25:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:25:23,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-25 15:25:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:23,945 INFO L225 Difference]: With dead ends: 806 [2019-02-25 15:25:23,945 INFO L226 Difference]: Without dead ends: 802 [2019-02-25 15:25:23,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:25:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-02-25 15:25:24,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 783. [2019-02-25 15:25:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-02-25 15:25:24,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 6028 transitions. [2019-02-25 15:25:24,228 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 6028 transitions. Word has length 6 [2019-02-25 15:25:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:24,228 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 6028 transitions. [2019-02-25 15:25:24,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:25:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 6028 transitions. [2019-02-25 15:25:24,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:24,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:24,230 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:25:24,230 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:24,230 INFO L82 PathProgramCache]: Analyzing trace with hash 904695138, now seen corresponding path program 2 times [2019-02-25 15:25:24,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:24,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:24,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:24,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:24,394 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2019-02-25 15:25:24,397 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:25:24,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:24,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:24,397 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:24,397 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:24,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:24,398 INFO 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:25:24,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:24,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:24,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:25:24,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:24,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:25:24,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:24,418 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:25:24,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,422 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 27 treesize of output 33 [2019-02-25 15:25:24,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:25:24,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,437 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 31 treesize of output 49 [2019-02-25 15:25:24,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,446 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:25:24,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,459 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:25:24,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,465 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,473 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 112 [2019-02-25 15:25:24,473 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,524 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,552 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,573 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,590 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,624 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,638 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,700 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 19 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:24,700 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,718 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,732 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,748 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,775 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,811 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,870 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 1 xjuncts. [2019-02-25 15:25:24,870 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:107, output treesize:112 [2019-02-25 15:25:24,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 112 [2019-02-25 15:25:24,894 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:24,950 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:24,950 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:122, output treesize:88 [2019-02-25 15:25:24,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:24,979 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 112 [2019-02-25 15:25:24,980 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:25,036 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:25,036 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:100, output treesize:88 [2019-02-25 15:25:25,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:25:25,058 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:25,074 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:25:25,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:25,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:25:25,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:25,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:25:25,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:25:25,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:25:25,092 INFO L87 Difference]: Start difference. First operand 783 states and 6028 transitions. Second operand 7 states. [2019-02-25 15:25:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:25,764 INFO L93 Difference]: Finished difference Result 802 states and 6046 transitions. [2019-02-25 15:25:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:25:25,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-25 15:25:25,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:25,771 INFO L225 Difference]: With dead ends: 802 [2019-02-25 15:25:25,772 INFO L226 Difference]: Without dead ends: 801 [2019-02-25 15:25:25,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:25:25,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-02-25 15:25:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 783. [2019-02-25 15:25:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-02-25 15:25:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 6028 transitions. [2019-02-25 15:25:26,076 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 6028 transitions. Word has length 6 [2019-02-25 15:25:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:26,076 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 6028 transitions. [2019-02-25 15:25:26,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:25:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 6028 transitions. [2019-02-25 15:25:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:26,078 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:26,078 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:25:26,078 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:26,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash 904669900, now seen corresponding path program 1 times [2019-02-25 15:25:26,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:26,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:26,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:26,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:26,185 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:26,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:26,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:26,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:26,186 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [26], [31] [2019-02-25 15:25:26,187 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:26,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:26,189 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:26,189 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 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:26,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:26,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:26,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:26,189 INFO 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:25:26,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:26,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:26,205 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:25:26,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:26,216 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 24 treesize of output 27 [2019-02-25 15:25:26,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,220 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 27 treesize of output 33 [2019-02-25 15:25:26,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,224 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,225 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 29 treesize of output 43 [2019-02-25 15:25:26,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,239 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 31 treesize of output 57 [2019-02-25 15:25:26,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,247 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:26,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,258 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:26,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,270 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:26,270 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,323 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,356 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,379 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,399 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,413 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,429 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:26,519 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,542 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,558 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,575 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,599 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,635 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,676 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,741 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:26,741 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:26,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:26,770 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,831 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:26,831 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:26,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,868 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 120 [2019-02-25 15:25:26,868 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:26,929 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:26,929 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:96 [2019-02-25 15:25:26,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:26,966 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:26,967 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:27,026 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:27,026 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:27,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:27,137 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:27,137 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:27,194 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:27,194 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-25 15:25:27,219 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:27,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:27,259 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:27,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:27,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:25:27,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:27,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:25:27,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:25:27,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:25:27,278 INFO L87 Difference]: Start difference. First operand 783 states and 6028 transitions. Second operand 11 states. [2019-02-25 15:25:28,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:28,716 INFO L93 Difference]: Finished difference Result 956 states and 7015 transitions. [2019-02-25 15:25:28,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:25:28,716 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:25:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:28,722 INFO L225 Difference]: With dead ends: 956 [2019-02-25 15:25:28,722 INFO L226 Difference]: Without dead ends: 954 [2019-02-25 15:25:28,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:28,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2019-02-25 15:25:28,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 808. [2019-02-25 15:25:28,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2019-02-25 15:25:28,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 6214 transitions. [2019-02-25 15:25:28,974 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 6214 transitions. Word has length 6 [2019-02-25 15:25:28,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:28,974 INFO L480 AbstractCegarLoop]: Abstraction has 808 states and 6214 transitions. [2019-02-25 15:25:28,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:25:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 6214 transitions. [2019-02-25 15:25:28,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:28,976 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:28,976 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:25:28,976 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:28,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash 904323940, now seen corresponding path program 2 times [2019-02-25 15:25:28,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:28,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:28,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:28,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:28,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:29,177 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:29,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:29,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:29,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:29,178 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:29,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:29,178 INFO 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:25:29,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:29,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:29,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:25:29,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:29,195 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:25:29,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:29,282 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:29,282 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,310 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,323 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,351 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,383 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,428 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,479 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:29,543 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:29,545 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:29,548 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:29,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, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:29,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, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:29,558 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:29,558 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,609 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,638 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,660 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,676 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,691 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,704 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,766 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:29,767 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:29,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,797 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:29,797 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,858 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:29,858 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:29,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:29,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:29,893 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:29,959 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:29,959 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:30,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 120 [2019-02-25 15:25:30,019 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:30,077 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:30,077 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:76 [2019-02-25 15:25:30,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:30,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:30,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:30,177 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:30,177 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-25 15:25:30,203 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:30,203 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:30,242 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:30,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:30,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:25:30,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:30,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:25:30,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:25:30,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:25:30,261 INFO L87 Difference]: Start difference. First operand 808 states and 6214 transitions. Second operand 11 states. [2019-02-25 15:25:31,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:31,494 INFO L93 Difference]: Finished difference Result 1087 states and 7943 transitions. [2019-02-25 15:25:31,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:25:31,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:25:31,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:31,501 INFO L225 Difference]: With dead ends: 1087 [2019-02-25 15:25:31,501 INFO L226 Difference]: Without dead ends: 1084 [2019-02-25 15:25:31,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2019-02-25 15:25:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 849. [2019-02-25 15:25:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-02-25 15:25:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 6541 transitions. [2019-02-25 15:25:31,845 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 6541 transitions. Word has length 6 [2019-02-25 15:25:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:31,845 INFO L480 AbstractCegarLoop]: Abstraction has 849 states and 6541 transitions. [2019-02-25 15:25:31,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:25:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 6541 transitions. [2019-02-25 15:25:31,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:31,847 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:31,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:31,847 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:31,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:31,847 INFO L82 PathProgramCache]: Analyzing trace with hash 904327972, now seen corresponding path program 1 times [2019-02-25 15:25:31,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:31,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:31,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:31,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:31,992 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:25:32,204 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:32,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:32,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:32,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:32,205 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [32], [33] [2019-02-25 15:25:32,205 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:32,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:32,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:32,207 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:32,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:32,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:32,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:32,208 INFO 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:25:32,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:32,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:32,238 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:25:32,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:32,450 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:32,451 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,468 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,479 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,495 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,520 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,548 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,582 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:32,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:32,588 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:32,591 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:32,593 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:32,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:32,604 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:32,604 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,640 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,668 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,689 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,706 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,721 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,734 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,779 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:25:32,780 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:32,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,833 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:32,834 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,873 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:32,874 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:32,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,909 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:32,909 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:32,948 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:32,948 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:32,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:32,985 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:32,986 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:32,986 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:33,024 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:33,024 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:33,049 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:33,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:33,140 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:25:33,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:33,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:33,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:33,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:33,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:33,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:33,158 INFO L87 Difference]: Start difference. First operand 849 states and 6541 transitions. Second operand 10 states. [2019-02-25 15:25:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:34,106 INFO L93 Difference]: Finished difference Result 942 states and 6912 transitions. [2019-02-25 15:25:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:34,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:25:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:34,110 INFO L225 Difference]: With dead ends: 942 [2019-02-25 15:25:34,110 INFO L226 Difference]: Without dead ends: 940 [2019-02-25 15:25:34,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-02-25 15:25:34,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 891. [2019-02-25 15:25:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-02-25 15:25:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 6849 transitions. [2019-02-25 15:25:34,438 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 6849 transitions. Word has length 6 [2019-02-25 15:25:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:34,438 INFO L480 AbstractCegarLoop]: Abstraction has 891 states and 6849 transitions. [2019-02-25 15:25:34,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 6849 transitions. [2019-02-25 15:25:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:34,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:34,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:34,440 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:34,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:34,440 INFO L82 PathProgramCache]: Analyzing trace with hash 904333738, now seen corresponding path program 1 times [2019-02-25 15:25:34,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:34,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:34,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:34,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:34,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:34,519 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:34,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:34,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:34,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:34,520 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [32], [33] [2019-02-25 15:25:34,520 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:34,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:34,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:34,523 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:34,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:34,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:34,524 INFO 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:25:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:34,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:34,544 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:25:34,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:34,547 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 24 treesize of output 27 [2019-02-25 15:25:34,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,551 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 27 treesize of output 33 [2019-02-25 15:25:34,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,557 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 29 treesize of output 43 [2019-02-25 15:25:34,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,564 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 31 treesize of output 57 [2019-02-25 15:25:34,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:34,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,581 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:34,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:34,592 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:34,592 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,647 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,678 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,729 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,748 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,766 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,781 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,864 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:34,865 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,888 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,900 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,923 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,950 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:34,989 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:35,029 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:35,093 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:25:35,093 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:35,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:35,130 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:35,193 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:35,194 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:35,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:35,234 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:35,299 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:35,299 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:35,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:35,337 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:35,338 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:35,338 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:35,395 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:35,395 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:25:35,420 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:35,420 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:35,454 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:25:35,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:35,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:25:35,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:35,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:25:35,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:25:35,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:35,474 INFO L87 Difference]: Start difference. First operand 891 states and 6849 transitions. Second operand 9 states. [2019-02-25 15:25:37,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:37,801 INFO L93 Difference]: Finished difference Result 959 states and 7083 transitions. [2019-02-25 15:25:37,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:37,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:25:37,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:37,806 INFO L225 Difference]: With dead ends: 959 [2019-02-25 15:25:37,806 INFO L226 Difference]: Without dead ends: 951 [2019-02-25 15:25:37,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:37,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-02-25 15:25:38,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 909. [2019-02-25 15:25:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-02-25 15:25:38,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 7020 transitions. [2019-02-25 15:25:38,178 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 7020 transitions. Word has length 6 [2019-02-25 15:25:38,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:38,178 INFO L480 AbstractCegarLoop]: Abstraction has 909 states and 7020 transitions. [2019-02-25 15:25:38,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:25:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 7020 transitions. [2019-02-25 15:25:38,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:38,180 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:38,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:38,180 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:38,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:38,181 INFO L82 PathProgramCache]: Analyzing trace with hash 904320284, now seen corresponding path program 1 times [2019-02-25 15:25:38,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:38,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:38,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:38,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:38,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:38,254 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:38,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:38,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:38,255 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:38,255 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [32], [33] [2019-02-25 15:25:38,255 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:38,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:38,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:38,258 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:38,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:38,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:38,259 INFO 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:25:38,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:38,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:38,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:38,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:25:38,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:38,308 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 24 treesize of output 27 [2019-02-25 15:25:38,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,355 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 27 treesize of output 33 [2019-02-25 15:25:38,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,416 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 29 treesize of output 43 [2019-02-25 15:25:38,455 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,498 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 31 treesize of output 57 [2019-02-25 15:25:38,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,608 INFO L292 Elim1Store]: Index analysis took 109 ms [2019-02-25 15:25:38,609 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:38,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:38,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:38,722 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:38,722 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,762 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,794 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,817 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,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:38,853 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,868 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,963 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:38,964 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,977 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,983 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:38,997 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,016 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,043 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,089 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:25:39,089 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:39,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,148 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:39,149 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,188 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:39,189 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:39,216 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,222 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:39,222 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,262 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:39,263 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:39,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:39,299 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:39,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:39,300 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:39,337 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:39,337 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:39,361 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:39,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:39,396 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:25:39,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:39,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:25:39,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:39,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:25:39,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:25:39,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:25:39,416 INFO L87 Difference]: Start difference. First operand 909 states and 7020 transitions. Second operand 9 states. [2019-02-25 15:25:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:40,325 INFO L93 Difference]: Finished difference Result 973 states and 7237 transitions. [2019-02-25 15:25:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:40,325 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:25:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:40,330 INFO L225 Difference]: With dead ends: 973 [2019-02-25 15:25:40,330 INFO L226 Difference]: Without dead ends: 972 [2019-02-25 15:25:40,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-02-25 15:25:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 929. [2019-02-25 15:25:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 929 states. [2019-02-25 15:25:40,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 7180 transitions. [2019-02-25 15:25:40,697 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 7180 transitions. Word has length 6 [2019-02-25 15:25:40,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:40,698 INFO L480 AbstractCegarLoop]: Abstraction has 929 states and 7180 transitions. [2019-02-25 15:25:40,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:25:40,698 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 7180 transitions. [2019-02-25 15:25:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:40,699 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:40,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:40,700 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash 904792908, now seen corresponding path program 1 times [2019-02-25 15:25:40,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:40,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:40,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:40,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:40,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:40,805 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:40,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:40,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:40,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:40,805 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [26], [31] [2019-02-25 15:25:40,806 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:40,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:40,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:40,808 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:25:40,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:40,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:40,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:40,809 INFO 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:25:40,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:40,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:40,829 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:25:40,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:40,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:40,882 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:40,903 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:40,925 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:40,950 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:40,978 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,015 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,060 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:41,062 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:41,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:41,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:41,071 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:41,074 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:41,162 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:41,163 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,200 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,228 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,249 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,267 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,280 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,293 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,339 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:41,339 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:41,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,413 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:41,414 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,454 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:41,455 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:41,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,588 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:41,589 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,629 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:41,629 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:41,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,672 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:41,672 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:41,673 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,714 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:41,714 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:41,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:41,753 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:41,754 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:25:41,754 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:41,792 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:41,793 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:25:41,818 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:41,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:41,874 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:25:41,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:41,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:25:41,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:41,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:41,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:41,893 INFO L87 Difference]: Start difference. First operand 929 states and 7180 transitions. Second operand 12 states. [2019-02-25 15:25:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:43,273 INFO L93 Difference]: Finished difference Result 1006 states and 7394 transitions. [2019-02-25 15:25:43,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:43,273 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:43,278 INFO L225 Difference]: With dead ends: 1006 [2019-02-25 15:25:43,278 INFO L226 Difference]: Without dead ends: 1004 [2019-02-25 15:25:43,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:25:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-02-25 15:25:43,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 890. [2019-02-25 15:25:43,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-02-25 15:25:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 6868 transitions. [2019-02-25 15:25:43,647 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 6868 transitions. Word has length 6 [2019-02-25 15:25:43,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:43,647 INFO L480 AbstractCegarLoop]: Abstraction has 890 states and 6868 transitions. [2019-02-25 15:25:43,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 6868 transitions. [2019-02-25 15:25:43,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:43,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:43,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:43,650 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:43,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:43,650 INFO L82 PathProgramCache]: Analyzing trace with hash 904808472, now seen corresponding path program 1 times [2019-02-25 15:25:43,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:43,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:43,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:43,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:43,741 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:43,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:43,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:43,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:43,742 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [32], [33] [2019-02-25 15:25:43,742 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:43,742 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:43,744 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:43,744 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:43,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:43,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:43,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:43,745 INFO 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:25:43,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:43,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:43,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:25:43,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:43,810 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:43,810 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:43,832 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:43,854 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:43,880 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:43,914 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:43,956 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:44,003 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:44,006 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:44,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:44,011 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:44,015 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:44,021 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:44,022 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,058 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,086 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,108 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,125 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,139 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,152 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,198 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:25:44,198 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:44,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,257 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:25:44,257 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,302 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:44,303 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:25:44,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:44,339 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,379 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:44,379 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:25:44,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:44,413 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:44,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:25:44,414 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:44,453 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:44,453 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:25:44,477 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:44,477 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:44,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:44,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:44,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:44,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:44,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:44,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:25:44,534 INFO L87 Difference]: Start difference. First operand 890 states and 6868 transitions. Second operand 10 states. [2019-02-25 15:25:45,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:45,580 INFO L93 Difference]: Finished difference Result 959 states and 7078 transitions. [2019-02-25 15:25:45,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:45,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:25:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:45,585 INFO L225 Difference]: With dead ends: 959 [2019-02-25 15:25:45,585 INFO L226 Difference]: Without dead ends: 958 [2019-02-25 15:25:45,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:45,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2019-02-25 15:25:45,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 910. [2019-02-25 15:25:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-02-25 15:25:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 7028 transitions. [2019-02-25 15:25:45,957 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 7028 transitions. Word has length 6 [2019-02-25 15:25:45,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:45,957 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 7028 transitions. [2019-02-25 15:25:45,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 7028 transitions. [2019-02-25 15:25:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:45,959 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:45,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:45,959 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:45,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash 904808346, now seen corresponding path program 1 times [2019-02-25 15:25:45,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:45,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:45,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:46,142 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2019-02-25 15:25:46,215 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:46,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:46,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:46,216 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:46,216 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [28], [31] [2019-02-25 15:25:46,217 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:46,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:46,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:46,219 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:25:46,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:46,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:46,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:46,220 INFO 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:25:46,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:46,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:46,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:46,236 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:25:46,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:46,300 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:25:46,300 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,314 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,327 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,345 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,365 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,394 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,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:46,432 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:46,434 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:46,436 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:46,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:46,443 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:46,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:46,454 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,491 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,519 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,539 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,556 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,571 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:46,584 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,630 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,630 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:25:46,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:25:46,689 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:46,834 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:25:46,835 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:106, output treesize:150 [2019-02-25 15:25:46,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,913 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:46,919 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 109 [2019-02-25 15:25:46,919 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:47,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,044 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 106 [2019-02-25 15:25:47,045 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:47,207 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2019-02-25 15:25:47,208 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:172, output treesize:177 [2019-02-25 15:25:47,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,298 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,299 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,300 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:47,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 122 [2019-02-25 15:25:47,310 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:25:47,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,583 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:47,584 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 93 [2019-02-25 15:25:47,584 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:47,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,734 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:47,734 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 105 [2019-02-25 15:25:47,735 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:47,871 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 17 dim-0 vars, and 4 xjuncts. [2019-02-25 15:25:47,872 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:207, output treesize:204 [2019-02-25 15:25:47,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:47,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,004 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:48,005 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 93 [2019-02-25 15:25:48,006 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:48,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,134 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,135 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 95 [2019-02-25 15:25:48,135 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:48,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:48,376 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:48,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 124 [2019-02-25 15:25:48,402 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2019-02-25 15:25:48,725 INFO L301 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-02-25 15:25:48,725 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:189, output treesize:310 [2019-02-25 15:25:48,975 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 133 [2019-02-25 15:25:48,977 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:48,977 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:49,068 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:25:49,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:49,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:25:49,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:49,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:49,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:49,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:25:49,089 INFO L87 Difference]: Start difference. First operand 910 states and 7028 transitions. Second operand 12 states. [2019-02-25 15:25:49,336 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-02-25 15:25:49,611 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 103 [2019-02-25 15:25:49,992 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-02-25 15:25:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:51,691 INFO L93 Difference]: Finished difference Result 1033 states and 7604 transitions. [2019-02-25 15:25:51,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:25:51,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:51,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:51,696 INFO L225 Difference]: With dead ends: 1033 [2019-02-25 15:25:51,696 INFO L226 Difference]: Without dead ends: 1032 [2019-02-25 15:25:51,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:25:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2019-02-25 15:25:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 910. [2019-02-25 15:25:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 910 states. [2019-02-25 15:25:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 7028 transitions. [2019-02-25 15:25:52,092 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 7028 transitions. Word has length 6 [2019-02-25 15:25:52,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:52,092 INFO L480 AbstractCegarLoop]: Abstraction has 910 states and 7028 transitions. [2019-02-25 15:25:52,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 7028 transitions. [2019-02-25 15:25:52,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:52,094 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:52,094 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:52,094 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash 904810394, now seen corresponding path program 1 times [2019-02-25 15:25:52,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:52,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:52,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:52,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:52,163 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,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:52,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:52,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:52,164 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [32], [33] [2019-02-25 15:25:52,165 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:52,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:52,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:52,166 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:52,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:52,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:52,167 INFO 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:25:52,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:52,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:52,190 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:25:52,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:52,234 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:52,234 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,260 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,274 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,290 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,317 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,350 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,394 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,445 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:25:52,448 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:52,451 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:52,455 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:52,458 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:52,461 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:52,463 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:52,463 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,513 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,542 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,564 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,581 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,596 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,609 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,673 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:25:52,673 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:52,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,707 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:52,707 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,768 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:52,769 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:52,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,807 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:52,808 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,867 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:52,867 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:52,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,899 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:52,910 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:52,911 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:52,912 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:52,968 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:52,968 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:25:54,997 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:54,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:55,036 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:25:55,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:55,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:25:55,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:55,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:25:55,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:25:55,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=114, Unknown=1, NotChecked=0, Total=182 [2019-02-25 15:25:55,056 INFO L87 Difference]: Start difference. First operand 910 states and 7028 transitions. Second operand 10 states. [2019-02-25 15:25:56,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:56,220 INFO L93 Difference]: Finished difference Result 975 states and 7194 transitions. [2019-02-25 15:25:56,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:25:56,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:25:56,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:56,224 INFO L225 Difference]: With dead ends: 975 [2019-02-25 15:25:56,224 INFO L226 Difference]: Without dead ends: 971 [2019-02-25 15:25:56,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=100, Invalid=171, Unknown=1, NotChecked=0, Total=272 [2019-02-25 15:25:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2019-02-25 15:25:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 926. [2019-02-25 15:25:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-02-25 15:25:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 7136 transitions. [2019-02-25 15:25:56,598 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 7136 transitions. Word has length 6 [2019-02-25 15:25:56,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:56,599 INFO L480 AbstractCegarLoop]: Abstraction has 926 states and 7136 transitions. [2019-02-25 15:25:56,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:25:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 7136 transitions. [2019-02-25 15:25:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:56,600 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:56,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:56,601 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:56,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash 904810206, now seen corresponding path program 2 times [2019-02-25 15:25:56,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:56,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:56,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:56,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:56,710 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:56,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:56,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:56,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:25:56,710 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:56,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:56,710 INFO 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:25:56,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:25:56,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:25:56,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:25:56,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:25:56,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:25:56,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:56,733 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 24 treesize of output 27 [2019-02-25 15:25:56,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,771 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 27 treesize of output 33 [2019-02-25 15:25:56,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,800 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 29 treesize of output 43 [2019-02-25 15:25:56,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,806 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 31 treesize of output 57 [2019-02-25 15:25:56,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,814 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:56,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,824 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:56,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:56,835 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:25:56,835 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,889 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,920 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25: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:25: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:25:56,980 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:56,996 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,067 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:25:57,068 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,087 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,097 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,114 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,136 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,170 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,211 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,276 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:57,276 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:118, output treesize:120 [2019-02-25 15:25:57,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,323 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:25:57,323 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,384 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:57,384 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:130, output treesize:96 [2019-02-25 15:25:57,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,429 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:57,430 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,489 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:57,489 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:108, output treesize:78 [2019-02-25 15:25:57,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,527 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,534 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:57,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:57,535 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,591 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:57,591 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:66 [2019-02-25 15:25:57,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:57,636 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:25:57,637 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:25:57,638 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:57,692 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:25:57,692 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:76, output treesize:58 [2019-02-25 15:25:57,720 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:57,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:25:57,779 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:57,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:25:57,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:25:57,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:25:57,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:25:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:25:57,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:25:57,798 INFO L87 Difference]: Start difference. First operand 926 states and 7136 transitions. Second operand 12 states. [2019-02-25 15:25:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:25:59,338 INFO L93 Difference]: Finished difference Result 1013 states and 7438 transitions. [2019-02-25 15:25:59,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:25:59,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:25:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:25:59,343 INFO L225 Difference]: With dead ends: 1013 [2019-02-25 15:25:59,343 INFO L226 Difference]: Without dead ends: 1011 [2019-02-25 15:25:59,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:25:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-02-25 15:25:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 937. [2019-02-25 15:25:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-02-25 15:25:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 7224 transitions. [2019-02-25 15:25:59,729 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 7224 transitions. Word has length 6 [2019-02-25 15:25:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:25:59,729 INFO L480 AbstractCegarLoop]: Abstraction has 937 states and 7224 transitions. [2019-02-25 15:25:59,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:25:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 7224 transitions. [2019-02-25 15:25:59,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:25:59,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:25:59,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:25:59,731 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:25:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 904796940, now seen corresponding path program 1 times [2019-02-25 15:25:59,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:25:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:59,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:25:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:25:59,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:25:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:59,796 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:59,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:59,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:25:59,797 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:25:59,797 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [32], [33] [2019-02-25 15:25:59,798 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:25:59,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:25:59,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:25:59,800 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:25:59,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:25:59,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:25:59,801 INFO 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:25:59,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:25:59,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:25:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:25:59,831 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:25:59,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:25:59,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 24 treesize of output 27 [2019-02-25 15:25:59,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:25:59,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:25:59,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,851 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:25:59,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:25:59,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:25:59,871 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:25:59,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:25:59,887 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,924 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,955 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,978 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:25:59,996 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,011 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,025 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,080 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:00,081 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,096 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,106 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,126 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,151 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,178 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,224 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:26:00,225 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:00,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,284 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:00,284 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,324 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:00,324 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:00,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,361 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:00,362 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,402 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:26:00,402 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:26:00,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:00,439 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:00,440 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:00,440 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:00,478 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:00,478 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:26:00,502 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:00,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:00,537 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:00,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:00,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:26:00,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:00,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:00,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:26:00,557 INFO L87 Difference]: Start difference. First operand 937 states and 7224 transitions. Second operand 10 states. [2019-02-25 15:26:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:01,470 INFO L93 Difference]: Finished difference Result 996 states and 7376 transitions. [2019-02-25 15:26:01,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:01,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:26:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:01,475 INFO L225 Difference]: With dead ends: 996 [2019-02-25 15:26:01,475 INFO L226 Difference]: Without dead ends: 995 [2019-02-25 15:26:01,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 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:26:01,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-02-25 15:26:01,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 949. [2019-02-25 15:26:01,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-02-25 15:26:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 7320 transitions. [2019-02-25 15:26:01,894 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 7320 transitions. Word has length 6 [2019-02-25 15:26:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:01,894 INFO L480 AbstractCegarLoop]: Abstraction has 949 states and 7320 transitions. [2019-02-25 15:26:01,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 7320 transitions. [2019-02-25 15:26:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:01,896 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:01,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:01,896 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:01,896 INFO L82 PathProgramCache]: Analyzing trace with hash 904796752, now seen corresponding path program 1 times [2019-02-25 15:26:01,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:01,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:01,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:02,056 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-02-25 15:26:02,091 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:02,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:02,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:02,092 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:02,092 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [26], [31] [2019-02-25 15:26:02,093 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:02,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:02,095 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:02,095 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:02,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:02,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:02,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:02,096 INFO 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:26:02,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:02,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:02,109 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:26:02,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:02,112 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 24 treesize of output 27 [2019-02-25 15:26:02,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,117 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 27 treesize of output 33 [2019-02-25 15:26:02,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,140 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 29 treesize of output 43 [2019-02-25 15:26:02,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,146 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 31 treesize of output 57 [2019-02-25 15:26:02,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:02,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:02,176 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:02,176 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,213 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,245 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,268 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,288 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,304 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,318 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,375 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:02,375 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,389 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,400 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,414 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,435 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,462 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,508 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:02,509 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:02,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:02,586 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,627 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:02,627 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:02,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,667 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:02,668 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,706 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:02,707 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:26:02,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,749 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:02,749 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:02,750 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,787 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:26:02,787 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:26:02,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:02,828 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:02,829 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:02,829 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:02,868 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:02,868 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:26:02,894 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:02,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:02,957 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:26:02,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:02,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:26:02,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:02,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:02,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:02,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:02,976 INFO L87 Difference]: Start difference. First operand 949 states and 7320 transitions. Second operand 12 states. [2019-02-25 15:26:04,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:04,291 INFO L93 Difference]: Finished difference Result 1033 states and 7605 transitions. [2019-02-25 15:26:04,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:04,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:26:04,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:04,296 INFO L225 Difference]: With dead ends: 1033 [2019-02-25 15:26:04,296 INFO L226 Difference]: Without dead ends: 1031 [2019-02-25 15:26:04,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:26:04,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-02-25 15:26:04,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 975. [2019-02-25 15:26:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-02-25 15:26:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 7528 transitions. [2019-02-25 15:26:04,696 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 7528 transitions. Word has length 6 [2019-02-25 15:26:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:04,696 INFO L480 AbstractCegarLoop]: Abstraction has 975 states and 7528 transitions. [2019-02-25 15:26:04,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 7528 transitions. [2019-02-25 15:26:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:04,697 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:04,698 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:04,698 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:04,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash 904456810, now seen corresponding path program 1 times [2019-02-25 15:26:04,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:04,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:04,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:04,699 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:04,778 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:26:04,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:04,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:04,778 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:04,778 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [32], [34], [35] [2019-02-25 15:26:04,779 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:04,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:04,780 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:04,781 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:26:04,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:04,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:04,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:04,781 INFO 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:26:04,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:04,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:04,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:04,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:04,797 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 24 treesize of output 27 [2019-02-25 15:26:04,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,802 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 27 treesize of output 33 [2019-02-25 15:26:04,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,813 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 29 treesize of output 43 [2019-02-25 15:26:04,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,819 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,819 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 31 treesize of output 57 [2019-02-25 15:26:04,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:04,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:04,835 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:04,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:04,848 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:04,887 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:04,918 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:04,943 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:04,963 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:04,980 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:04,993 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,049 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:05,049 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,063 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,071 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,082 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,101 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,128 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,174 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:05,174 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:05,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,221 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:05,222 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,262 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:26:05,262 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:05,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:05,288 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:05,288 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:05,289 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:05,329 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:05,330 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:26:05,350 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:26:05,351 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:05,374 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:26:05,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:05,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:26:05,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:05,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:26:05,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:26:05,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:26:05,396 INFO L87 Difference]: Start difference. First operand 975 states and 7528 transitions. Second operand 8 states. [2019-02-25 15:26:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:06,174 INFO L93 Difference]: Finished difference Result 1002 states and 7555 transitions. [2019-02-25 15:26:06,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:26:06,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:26:06,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:06,179 INFO L225 Difference]: With dead ends: 1002 [2019-02-25 15:26:06,179 INFO L226 Difference]: Without dead ends: 1001 [2019-02-25 15:26:06,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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:26:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-02-25 15:26:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 975. [2019-02-25 15:26:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-02-25 15:26:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 7528 transitions. [2019-02-25 15:26:06,605 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 7528 transitions. Word has length 6 [2019-02-25 15:26:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:06,605 INFO L480 AbstractCegarLoop]: Abstraction has 975 states and 7528 transitions. [2019-02-25 15:26:06,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:26:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 7528 transitions. [2019-02-25 15:26:06,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:06,607 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:06,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:06,607 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash 904431572, now seen corresponding path program 1 times [2019-02-25 15:26:06,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:06,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:06,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:06,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:06,779 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:06,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:06,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:06,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:06,779 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [26], [31] [2019-02-25 15:26:06,780 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:06,780 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:06,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:06,782 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:06,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:06,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:06,782 INFO 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:26:06,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:06,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:06,796 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:26:06,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:06,800 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 24 treesize of output 27 [2019-02-25 15:26:06,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,804 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 27 treesize of output 33 [2019-02-25 15:26:06,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,810 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 29 treesize of output 43 [2019-02-25 15:26:06,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,819 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 31 treesize of output 57 [2019-02-25 15:26:06,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,824 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:06,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:06,836 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:06,849 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:06,850 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:06,890 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:06,922 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:06,946 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:06,966 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:06,983 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:06,996 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,052 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:07,052 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,068 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,081 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,094 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,112 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,139 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,185 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:26:07,185 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:07,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,253 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:07,253 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,290 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:07,291 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:07,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,325 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:07,326 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:07,327 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,367 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:26:07,367 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:26:07,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,404 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:26:07,405 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,443 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:26:07,444 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-02-25 15:26:07,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:07,480 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:07,481 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:26:07,482 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:07,521 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:07,521 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:26:07,545 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:07,545 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:07,580 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:26:07,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:07,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-02-25 15:26:07,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:07,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:07,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:26:07,600 INFO L87 Difference]: Start difference. First operand 975 states and 7528 transitions. Second operand 12 states. [2019-02-25 15:26:08,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:08,886 INFO L93 Difference]: Finished difference Result 1224 states and 9054 transitions. [2019-02-25 15:26:08,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:26:08,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:26:08,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:08,892 INFO L225 Difference]: With dead ends: 1224 [2019-02-25 15:26:08,892 INFO L226 Difference]: Without dead ends: 1222 [2019-02-25 15:26:08,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:26:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2019-02-25 15:26:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 1073. [2019-02-25 15:26:09,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1073 states. [2019-02-25 15:26:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 8311 transitions. [2019-02-25 15:26:09,359 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 8311 transitions. Word has length 6 [2019-02-25 15:26:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:09,359 INFO L480 AbstractCegarLoop]: Abstraction has 1073 states and 8311 transitions. [2019-02-25 15:26:09,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 8311 transitions. [2019-02-25 15:26:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:09,361 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:09,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:09,361 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:09,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:09,361 INFO L82 PathProgramCache]: Analyzing trace with hash 904447136, now seen corresponding path program 1 times [2019-02-25 15:26:09,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:09,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:09,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:09,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:09,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:09,640 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-02-25 15:26:09,728 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:09,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:09,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:09,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:09,729 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [32], [33] [2019-02-25 15:26:09,730 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:09,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:09,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:09,732 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:09,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:09,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:09,732 INFO 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:26:09,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:09,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:09,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:26:09,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:09,749 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 24 treesize of output 27 [2019-02-25 15:26:09,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,752 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 27 treesize of output 33 [2019-02-25 15:26:09,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,759 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 29 treesize of output 43 [2019-02-25 15:26:09,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,778 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 31 treesize of output 57 [2019-02-25 15:26:09,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,788 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:09,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:09,797 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:09,809 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:09,810 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:09,848 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:09,880 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:09,905 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:09,925 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:09,940 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:09,955 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,021 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:10,022 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,037 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,048 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,062 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,081 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,109 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,155 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,155 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:10,198 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,198 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:10,199 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,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:26:10,239 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:10,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,273 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:10,274 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:10,274 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,312 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:26:10,312 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:26:10,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:10,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:26:10,353 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:10,392 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:10,392 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-25 15:26:10,422 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,422 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:10,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:26:10,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:10,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:26:10,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:10,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:26:10,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:26:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:26:10,476 INFO L87 Difference]: Start difference. First operand 1073 states and 8311 transitions. Second operand 11 states. [2019-02-25 15:26:12,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:12,449 INFO L93 Difference]: Finished difference Result 1388 states and 10131 transitions. [2019-02-25 15:26:12,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:26:12,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:26:12,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:12,456 INFO L225 Difference]: With dead ends: 1388 [2019-02-25 15:26:12,456 INFO L226 Difference]: Without dead ends: 1386 [2019-02-25 15:26:12,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:26:12,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2019-02-25 15:26:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1170. [2019-02-25 15:26:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-02-25 15:26:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 9078 transitions. [2019-02-25 15:26:12,937 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 9078 transitions. Word has length 6 [2019-02-25 15:26:12,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:12,937 INFO L480 AbstractCegarLoop]: Abstraction has 1170 states and 9078 transitions. [2019-02-25 15:26:12,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:26:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 9078 transitions. [2019-02-25 15:26:12,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:12,939 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:12,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:12,940 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:12,940 INFO L82 PathProgramCache]: Analyzing trace with hash 904933466, now seen corresponding path program 1 times [2019-02-25 15:26:12,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:12,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:12,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:12,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:13,085 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:26:13,097 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:26:13,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:13,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:13,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:13,097 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [32], [34], [35] [2019-02-25 15:26:13,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:13,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:13,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:13,102 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:26:13,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:13,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:13,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:13,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:26:13,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:13,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:13,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:26:13,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:13,161 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 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:26:13,161 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,180 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,201 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,235 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,267 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,304 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 24 treesize of output 27 [2019-02-25 15:26:13,306 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 27 treesize of output 33 [2019-02-25 15:26:13,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:26:13,314 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-02-25 15:26:13,321 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:26:13,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:26:13,338 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:26:13,339 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,372 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,396 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,415 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,429 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,443 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,455 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,496 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:13,496 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:84, output treesize:88 [2019-02-25 15:26:13,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:13,565 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:26:13,566 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,602 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:26:13,602 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:93, output treesize:63 [2019-02-25 15:26:13,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:13,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:13,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:13,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:13,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:13,631 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:13,632 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 85 [2019-02-25 15:26:13,632 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:13,666 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:13,666 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:75, output treesize:53 [2019-02-25 15:26:13,687 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:26:13,687 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:13,707 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:26:13,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:13,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:26:13,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:13,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:26:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:26:13,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:26:13,727 INFO L87 Difference]: Start difference. First operand 1170 states and 9078 transitions. Second operand 8 states. [2019-02-25 15:26:14,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:14,502 INFO L93 Difference]: Finished difference Result 1195 states and 9103 transitions. [2019-02-25 15:26:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:26:14,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:26:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:14,508 INFO L225 Difference]: With dead ends: 1195 [2019-02-25 15:26:14,508 INFO L226 Difference]: Without dead ends: 1194 [2019-02-25 15:26:14,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 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:26:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2019-02-25 15:26:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1170. [2019-02-25 15:26:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-02-25 15:26:14,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 9078 transitions. [2019-02-25 15:26:14,990 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 9078 transitions. Word has length 6 [2019-02-25 15:26:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:14,990 INFO L480 AbstractCegarLoop]: Abstraction has 1170 states and 9078 transitions. [2019-02-25 15:26:14,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:26:14,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 9078 transitions. [2019-02-25 15:26:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:14,993 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:14,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:14,993 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:14,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:14,994 INFO L82 PathProgramCache]: Analyzing trace with hash 904929558, now seen corresponding path program 1 times [2019-02-25 15:26:14,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:14,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:14,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:14,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:15,085 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:15,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:15,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:15,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:15,086 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [32], [33] [2019-02-25 15:26:15,087 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:15,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:15,089 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:15,089 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:15,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:15,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:15,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:15,089 INFO 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:26:15,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:15,098 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:15,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:26:15,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:15,108 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 24 treesize of output 27 [2019-02-25 15:26:15,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,111 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 27 treesize of output 33 [2019-02-25 15:26:15,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,117 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 29 treesize of output 43 [2019-02-25 15:26:15,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,124 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 31 treesize of output 57 [2019-02-25 15:26:15,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,134 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:15,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,141 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:15,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,152 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:15,153 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,209 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,240 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,263 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,284 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,301 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,316 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:26:15,386 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,411 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,425 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,447 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,474 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,504 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,545 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,609 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:26:15,610 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:26:15,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,647 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:15,648 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,708 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:26:15,709 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:26:15,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,746 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:15,747 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:15,748 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,806 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:15,806 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:82 [2019-02-25 15:26:15,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,843 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:15,844 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 124 [2019-02-25 15:26:15,845 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:15,903 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:15,903 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:94, output treesize:68 [2019-02-25 15:26:15,930 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:15,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:15,968 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:15,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:15,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:26:15,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:15,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:15,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:15,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:26:15,986 INFO L87 Difference]: Start difference. First operand 1170 states and 9078 transitions. Second operand 10 states. [2019-02-25 15:26:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:17,063 INFO L93 Difference]: Finished difference Result 1234 states and 9256 transitions. [2019-02-25 15:26:17,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:17,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:26:17,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:17,069 INFO L225 Difference]: With dead ends: 1234 [2019-02-25 15:26:17,069 INFO L226 Difference]: Without dead ends: 1231 [2019-02-25 15:26:17,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2019-02-25 15:26:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1189. [2019-02-25 15:26:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1189 states. [2019-02-25 15:26:17,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1189 states to 1189 states and 9209 transitions. [2019-02-25 15:26:17,560 INFO L78 Accepts]: Start accepts. Automaton has 1189 states and 9209 transitions. Word has length 6 [2019-02-25 15:26:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:17,560 INFO L480 AbstractCegarLoop]: Abstraction has 1189 states and 9209 transitions. [2019-02-25 15:26:17,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:17,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1189 states and 9209 transitions. [2019-02-25 15:26:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:17,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:17,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:17,563 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash 904928874, now seen corresponding path program 1 times [2019-02-25 15:26:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:17,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:17,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:17,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:17,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:17,632 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:17,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:17,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:17,633 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:17,633 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [28], [31] [2019-02-25 15:26:17,635 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:17,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:17,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:17,637 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:17,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:17,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:17,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:17,638 INFO 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:26:17,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:17,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:17,654 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:26:17,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:17,681 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:17,682 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,718 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,728 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,745 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,768 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,796 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,832 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:26:17,834 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:17,838 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:17,841 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:17,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:17,847 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:17,856 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:17,857 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,892 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,920 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,941 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,959 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,973 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:17,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:18,032 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:18,032 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:18,081 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,090 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-02-25 15:26:18,091 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:18,235 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:18,235 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:106, output treesize:150 [2019-02-25 15:26:18,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,315 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:18,323 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 106 [2019-02-25 15:26:18,325 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:26:18,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,503 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:18,504 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 113 [2019-02-25 15:26:18,504 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:18,648 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 3 xjuncts. [2019-02-25 15:26:18,649 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:172, output treesize:191 [2019-02-25 15:26:18,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,758 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:18,759 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 93 [2019-02-25 15:26:18,759 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:18,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:18,895 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 136 [2019-02-25 15:26:18,899 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-25 15:26:19,324 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:26:19,325 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:152, output treesize:346 [2019-02-25 15:26:19,762 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 129 [2019-02-25 15:26:19,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,778 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,780 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:19,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 103 [2019-02-25 15:26:19,782 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:19,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:19,938 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:19,938 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2019-02-25 15:26:19,939 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:20,082 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,083 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,085 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,094 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:20,094 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 99 [2019-02-25 15:26:20,095 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:20,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:20,246 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:20,247 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 103 [2019-02-25 15:26:20,248 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:20,376 INFO L301 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 4 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2019-02-25 15:26:20,376 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 24 variables, input treesize:267, output treesize:227 [2019-02-25 15:26:20,533 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 107 [2019-02-25 15:26:20,535 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:20,535 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:20,623 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:26:20,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:26:20,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:20,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:20,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:20,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:20,642 INFO L87 Difference]: Start difference. First operand 1189 states and 9209 transitions. Second operand 12 states. [2019-02-25 15:26:20,891 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2019-02-25 15:26:23,171 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 110 [2019-02-25 15:26:24,160 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 87 [2019-02-25 15:26:26,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:26,035 INFO L93 Difference]: Finished difference Result 1298 states and 9503 transitions. [2019-02-25 15:26:26,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:26:26,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:26:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:26,041 INFO L225 Difference]: With dead ends: 1298 [2019-02-25 15:26:26,041 INFO L226 Difference]: Without dead ends: 1297 [2019-02-25 15:26:26,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=155, Invalid=306, Unknown=1, NotChecked=0, Total=462 [2019-02-25 15:26:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-02-25 15:26:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1166. [2019-02-25 15:26:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1166 states. [2019-02-25 15:26:26,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 9025 transitions. [2019-02-25 15:26:26,513 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 9025 transitions. Word has length 6 [2019-02-25 15:26:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:26,513 INFO L480 AbstractCegarLoop]: Abstraction has 1166 states and 9025 transitions. [2019-02-25 15:26:26,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 9025 transitions. [2019-02-25 15:26:26,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:26,515 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:26,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:26,515 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:26,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash 904915420, now seen corresponding path program 1 times [2019-02-25 15:26:26,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:26,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:26,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:26,685 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:26,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:26,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:26,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:26,685 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [26], [31] [2019-02-25 15:26:26,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:26,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:26,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:26,688 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:26,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:26,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:26,689 INFO 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:26,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:26,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:26,703 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:26:26,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:26,772 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:26,773 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,793 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,808 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,834 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,862 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,903 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:26,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:26:26,952 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:26,955 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:26,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:26,960 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:26,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:26,971 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:26,971 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,008 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,036 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,058 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,075 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,089 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,102 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,149 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:27,149 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:27,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,233 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:27,233 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,274 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:27,275 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:27,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,315 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:27,316 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:27,316 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,356 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:27,357 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:61 [2019-02-25 15:26:27,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:26:27,402 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,442 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:26:27,442 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-02-25 15:26:27,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:27,487 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:27,488 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:26:27,488 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:27,549 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:27,549 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:26:27,576 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:27,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:27,639 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:26:27,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:27,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:26:27,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:27,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:27,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:27,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:27,658 INFO L87 Difference]: Start difference. First operand 1166 states and 9025 transitions. Second operand 12 states. [2019-02-25 15:26:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:29,335 INFO L93 Difference]: Finished difference Result 1222 states and 9088 transitions. [2019-02-25 15:26:29,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:29,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:26:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:29,342 INFO L225 Difference]: With dead ends: 1222 [2019-02-25 15:26:29,342 INFO L226 Difference]: Without dead ends: 1221 [2019-02-25 15:26:29,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 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:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-02-25 15:26:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1122. [2019-02-25 15:26:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1122 states. [2019-02-25 15:26:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 8658 transitions. [2019-02-25 15:26:29,851 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 8658 transitions. Word has length 6 [2019-02-25 15:26:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:29,851 INFO L480 AbstractCegarLoop]: Abstraction has 1122 states and 8658 transitions. [2019-02-25 15:26:29,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 8658 transitions. [2019-02-25 15:26:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:29,853 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:29,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:29,854 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:29,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:29,854 INFO L82 PathProgramCache]: Analyzing trace with hash 904975686, now seen corresponding path program 1 times [2019-02-25 15:26:29,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:29,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:29,901 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:29,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:29,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:29,902 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:29,902 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [32], [33] [2019-02-25 15:26:29,903 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:29,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:29,904 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:29,905 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:29,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:29,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:29,905 INFO 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:29,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:29,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:29,920 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:26:29,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:29,957 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:26:29,957 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:29,984 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:29,997 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,017 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,041 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,083 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,127 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,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:26:30,179 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:30,182 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:30,184 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:30,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:30,189 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:30,192 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:30,192 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,242 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,271 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,292 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,309 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,324 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,337 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,401 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:26:30,402 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:26:30,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,439 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:30,440 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,501 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:26:30,502 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:26:30,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:30,540 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,598 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:30,598 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:108, output treesize:78 [2019-02-25 15:26:30,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:30,640 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:30,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:30,641 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:30,698 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:30,698 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:26:30,728 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:30,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:30,767 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:30,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:30,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:26:30,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:30,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:26:30,785 INFO L87 Difference]: Start difference. First operand 1122 states and 8658 transitions. Second operand 10 states. [2019-02-25 15:26:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:31,898 INFO L93 Difference]: Finished difference Result 1181 states and 8791 transitions. [2019-02-25 15:26:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:31,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:26:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:31,903 INFO L225 Difference]: With dead ends: 1181 [2019-02-25 15:26:31,903 INFO L226 Difference]: Without dead ends: 1180 [2019-02-25 15:26:31,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 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:26:31,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2019-02-25 15:26:32,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1130. [2019-02-25 15:26:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2019-02-25 15:26:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 8722 transitions. [2019-02-25 15:26:32,420 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 8722 transitions. Word has length 6 [2019-02-25 15:26:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:32,420 INFO L480 AbstractCegarLoop]: Abstraction has 1130 states and 8722 transitions. [2019-02-25 15:26:32,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 8722 transitions. [2019-02-25 15:26:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:32,422 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:32,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:32,422 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:32,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 893612886, now seen corresponding path program 1 times [2019-02-25 15:26:32,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:32,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:32,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:32,486 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:26:32,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:32,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:32,487 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:32,487 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [34], [35] [2019-02-25 15:26:32,488 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:32,488 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:32,489 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:32,489 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:26:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:32,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:32,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:32,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:32,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:32,505 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:32,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:32,508 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-02-25 15:26:32,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,511 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 27 treesize of output 33 [2019-02-25 15:26:32,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,516 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 29 treesize of output 43 [2019-02-25 15:26:32,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,524 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 31 treesize of output 57 [2019-02-25 15:26:32,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,532 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:32,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:32,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:32,555 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,594 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,625 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,649 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,668 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,684 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,698 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,755 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:32,755 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,772 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,782 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,796 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,817 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26: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:26:32,891 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:32,891 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:32,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:32,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:32,942 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:32,983 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:26:32,983 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:33,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:33,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:33,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:33,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:33,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:33,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:33,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:33,013 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:33,014 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:33,054 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:33,054 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:26:33,077 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:26:33,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:33,093 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:26:33,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:33,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:26:33,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:33,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:26:33,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:26:33,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:26:33,113 INFO L87 Difference]: Start difference. First operand 1130 states and 8722 transitions. Second operand 8 states. [2019-02-25 15:26:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:34,094 INFO L93 Difference]: Finished difference Result 1200 states and 9000 transitions. [2019-02-25 15:26:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:34,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:26:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:34,100 INFO L225 Difference]: With dead ends: 1200 [2019-02-25 15:26:34,100 INFO L226 Difference]: Without dead ends: 1199 [2019-02-25 15:26:34,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:26:34,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2019-02-25 15:26:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 1150. [2019-02-25 15:26:34,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-02-25 15:26:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 8882 transitions. [2019-02-25 15:26:34,769 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 8882 transitions. Word has length 6 [2019-02-25 15:26:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:34,769 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 8882 transitions. [2019-02-25 15:26:34,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:26:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 8882 transitions. [2019-02-25 15:26:34,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:34,771 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:34,771 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:26:34,771 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:34,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:34,771 INFO L82 PathProgramCache]: Analyzing trace with hash 893590996, now seen corresponding path program 2 times [2019-02-25 15:26:34,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:34,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:34,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:34,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:34,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:34,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:34,825 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:34,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:34,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:34,825 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:26:34,825 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:34,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:34,825 INFO 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:34,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:26:34,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:26:34,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:26:34,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:26:34,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:26:34,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:34,844 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 24 treesize of output 27 [2019-02-25 15:26:34,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,849 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 27 treesize of output 33 [2019-02-25 15:26:34,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,853 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,853 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 29 treesize of output 43 [2019-02-25 15:26:34,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,861 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 31 treesize of output 57 [2019-02-25 15:26:34,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:34,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:34,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:34,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:34,891 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:34,948 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:34,980 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,006 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,026 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,041 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,057 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,126 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:26:35,127 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,151 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,167 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,188 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,222 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,259 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,301 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,364 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,364 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-02-25 15:26:35,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,399 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:35,399 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,459 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:26:35,460 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:26:35,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,490 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:35,491 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,550 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,550 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:76 [2019-02-25 15:26:35,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,594 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:35,595 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:35,596 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,655 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,656 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:66 [2019-02-25 15:26:35,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:35,700 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 27 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 122 [2019-02-25 15:26:35,701 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:35,760 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:35,760 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:78, output treesize:62 [2019-02-25 15:26:35,803 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:35,803 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:35,848 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:26:35,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:26:35,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:35,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:26:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:26:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:35,867 INFO L87 Difference]: Start difference. First operand 1150 states and 8882 transitions. Second operand 11 states. [2019-02-25 15:26:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:37,390 INFO L93 Difference]: Finished difference Result 1456 states and 10849 transitions. [2019-02-25 15:26:37,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:26:37,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:26:37,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:37,396 INFO L225 Difference]: With dead ends: 1456 [2019-02-25 15:26:37,396 INFO L226 Difference]: Without dead ends: 1455 [2019-02-25 15:26:37,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:26:37,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2019-02-25 15:26:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1376. [2019-02-25 15:26:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1376 states. [2019-02-25 15:26:38,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 10689 transitions. [2019-02-25 15:26:38,022 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 10689 transitions. Word has length 6 [2019-02-25 15:26:38,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:38,023 INFO L480 AbstractCegarLoop]: Abstraction has 1376 states and 10689 transitions. [2019-02-25 15:26:38,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:26:38,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 10689 transitions. [2019-02-25 15:26:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:38,025 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:38,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:38,025 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash 893591492, now seen corresponding path program 2 times [2019-02-25 15:26:38,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:38,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:26:38,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:38,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:38,197 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:38,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:38,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:38,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:26:38,198 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:38,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:38,198 INFO 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:38,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:26:38,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:26:38,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:26:38,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:26:38,214 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:26:38,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:38,225 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 24 treesize of output 27 [2019-02-25 15:26:38,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,228 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 27 treesize of output 33 [2019-02-25 15:26:38,232 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,234 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 29 treesize of output 43 [2019-02-25 15:26:38,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,241 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 31 treesize of output 57 [2019-02-25 15:26:38,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,247 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:38,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,259 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:38,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,270 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:38,271 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,328 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,361 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,384 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,405 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,422 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,438 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,507 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:26:38,507 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,531 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,550 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,578 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,610 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,649 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,690 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,755 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:26:38,755 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:26:38,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,796 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:38,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,857 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:38,857 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:130, output treesize:96 [2019-02-25 15:26:38,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,895 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:38,896 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:38,956 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:26:38,956 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:76 [2019-02-25 15:26:38,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:38,997 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:38,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:38,999 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:39,058 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:39,058 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:66 [2019-02-25 15:26:39,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:39,099 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:39,100 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 124 [2019-02-25 15:26:39,100 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:39,157 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:39,157 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:78, output treesize:64 [2019-02-25 15:26:39,184 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:39,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:39,241 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:26:39,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:39,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:26:39,259 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:39,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:26:39,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:26:39,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:26:39,259 INFO L87 Difference]: Start difference. First operand 1376 states and 10689 transitions. Second operand 12 states. [2019-02-25 15:26:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:41,192 INFO L93 Difference]: Finished difference Result 1569 states and 11731 transitions. [2019-02-25 15:26:41,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:26:41,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:26:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:41,199 INFO L225 Difference]: With dead ends: 1569 [2019-02-25 15:26:41,199 INFO L226 Difference]: Without dead ends: 1567 [2019-02-25 15:26:41,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:26:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2019-02-25 15:26:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 904. [2019-02-25 15:26:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-02-25 15:26:41,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 6903 transitions. [2019-02-25 15:26:41,679 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 6903 transitions. Word has length 6 [2019-02-25 15:26:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:41,679 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 6903 transitions. [2019-02-25 15:26:41,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:26:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 6903 transitions. [2019-02-25 15:26:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:41,681 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:41,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:41,682 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash 893710844, now seen corresponding path program 1 times [2019-02-25 15:26:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:41,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:26:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:41,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:41,853 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:41,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:41,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:41,853 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:41,854 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [32], [33] [2019-02-25 15:26:41,854 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:41,854 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:41,856 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:41,856 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:41,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:41,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:41,856 INFO 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:41,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:41,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:41,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:26:41,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:41,873 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 24 treesize of output 27 [2019-02-25 15:26:41,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,875 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 27 treesize of output 33 [2019-02-25 15:26:41,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,881 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 29 treesize of output 43 [2019-02-25 15:26:41,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,888 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 31 treesize of output 57 [2019-02-25 15:26:41,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:41,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:41,905 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:41,915 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:41,915 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:41,956 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:41,988 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,011 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,031 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,047 INFO L301 ElimStorePlain]: Start of recursive call 3: 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 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,200 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:42,201 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,484 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,573 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,710 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,731 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,758 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,805 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:42,805 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:42,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,850 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:42,851 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,891 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:26:42,891 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:42,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,920 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:42,921 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:42,922 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:42,962 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:42,962 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:59 [2019-02-25 15:26:42,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,993 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:42,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:42,998 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:43,038 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:43,038 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-02-25 15:26:43,062 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:43,063 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:43,078 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:26:43,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:43,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:26:43,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:43,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:26:43,098 INFO L87 Difference]: Start difference. First operand 904 states and 6903 transitions. Second operand 10 states. [2019-02-25 15:26:44,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:44,213 INFO L93 Difference]: Finished difference Result 1031 states and 7569 transitions. [2019-02-25 15:26:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:26:44,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:26:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:44,218 INFO L225 Difference]: With dead ends: 1031 [2019-02-25 15:26:44,218 INFO L226 Difference]: Without dead ends: 1029 [2019-02-25 15:26:44,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:44,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-02-25 15:26:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 928. [2019-02-25 15:26:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2019-02-25 15:26:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 7068 transitions. [2019-02-25 15:26:44,712 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 7068 transitions. Word has length 6 [2019-02-25 15:26:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:44,712 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 7068 transitions. [2019-02-25 15:26:44,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:26:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 7068 transitions. [2019-02-25 15:26:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:44,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:44,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:44,714 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:44,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:44,714 INFO L82 PathProgramCache]: Analyzing trace with hash 893728142, now seen corresponding path program 1 times [2019-02-25 15:26:44,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:44,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:44,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:44,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:44,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:44,836 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:44,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:44,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:44,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:44,837 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [32], [33] [2019-02-25 15:26:44,838 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:44,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:44,840 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:44,840 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:44,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:44,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:44,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:44,841 INFO 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:26:44,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:44,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:44,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:26:44,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:44,894 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:26:44,895 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,916 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,926 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,947 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:44,978 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,024 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,070 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,141 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:26:45,143 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:45,146 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:45,149 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:45,165 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:45,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:45,177 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:45,178 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,226 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,255 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,276 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,293 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,308 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,322 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,386 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:26:45,386 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:26:45,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,417 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:45,417 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,476 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:26:45,477 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:26:45,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,517 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:45,518 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:45,518 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,575 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:45,576 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:80 [2019-02-25 15:26:45,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,606 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,614 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:45,616 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:45,616 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:45,617 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:45,674 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:45,674 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:90, output treesize:72 [2019-02-25 15:26:45,709 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:45,709 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:45,757 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:45,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:45,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-02-25 15:26:45,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:45,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:26:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:26:45,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:26:45,775 INFO L87 Difference]: Start difference. First operand 928 states and 7068 transitions. Second operand 11 states. [2019-02-25 15:26:46,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:46,975 INFO L93 Difference]: Finished difference Result 980 states and 7166 transitions. [2019-02-25 15:26:46,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:46,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:26:46,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:46,980 INFO L225 Difference]: With dead ends: 980 [2019-02-25 15:26:46,980 INFO L226 Difference]: Without dead ends: 977 [2019-02-25 15:26:46,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:26:46,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-02-25 15:26:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 935. [2019-02-25 15:26:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2019-02-25 15:26:47,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 7124 transitions. [2019-02-25 15:26:47,478 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 7124 transitions. Word has length 6 [2019-02-25 15:26:47,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:47,479 INFO L480 AbstractCegarLoop]: Abstraction has 935 states and 7124 transitions. [2019-02-25 15:26:47,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:26:47,479 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 7124 transitions. [2019-02-25 15:26:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:47,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:47,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:47,481 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:47,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:47,481 INFO L82 PathProgramCache]: Analyzing trace with hash 893714688, now seen corresponding path program 1 times [2019-02-25 15:26:47,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:47,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:47,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:47,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:47,527 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:47,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:47,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:47,527 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:47,527 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [32], [33] [2019-02-25 15:26:47,528 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:47,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:47,530 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:47,530 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:47,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:47,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:47,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:47,531 INFO 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:26:47,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:47,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:47,544 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:26:47,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:47,563 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 24 treesize of output 27 [2019-02-25 15:26:47,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,602 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 27 treesize of output 33 [2019-02-25 15:26:47,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,623 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 29 treesize of output 43 [2019-02-25 15:26:47,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,630 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 31 treesize of output 57 [2019-02-25 15:26:47,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:47,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:47,686 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:47,700 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:47,701 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,761 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,790 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,815 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,834 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,850 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,865 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:47,922 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,938 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,954 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,971 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:47,994 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:48,021 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:48,067 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:26:48,068 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:48,119 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,120 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:48,120 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:48,161 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:48,161 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:48,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,191 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,192 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,192 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:48,193 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:48,193 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:48,235 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:26:48,236 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-02-25 15:26:48,262 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,263 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,265 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:48,271 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:48,271 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:48,272 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:48,308 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:48,309 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:55 [2019-02-25 15:26:48,336 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:48,336 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:48,371 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:48,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:48,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:26:48,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:48,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:26:48,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:26:48,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:48,391 INFO L87 Difference]: Start difference. First operand 935 states and 7124 transitions. Second operand 9 states. [2019-02-25 15:26:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:49,451 INFO L93 Difference]: Finished difference Result 975 states and 7191 transitions. [2019-02-25 15:26:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:49,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:26:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:49,456 INFO L225 Difference]: With dead ends: 975 [2019-02-25 15:26:49,456 INFO L226 Difference]: Without dead ends: 974 [2019-02-25 15:26:49,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2019-02-25 15:26:49,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 939. [2019-02-25 15:26:49,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 939 states. [2019-02-25 15:26:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 7156 transitions. [2019-02-25 15:26:49,959 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 7156 transitions. Word has length 6 [2019-02-25 15:26:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:49,959 INFO L480 AbstractCegarLoop]: Abstraction has 939 states and 7156 transitions. [2019-02-25 15:26:49,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:26:49,959 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 7156 transitions. [2019-02-25 15:26:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:49,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:49,960 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:49,961 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:49,961 INFO L82 PathProgramCache]: Analyzing trace with hash 893374558, now seen corresponding path program 1 times [2019-02-25 15:26:49,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:49,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:49,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:49,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:50,107 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:26:50,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:50,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:50,108 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:50,108 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [32], [34], [35] [2019-02-25 15:26:50,109 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:50,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:50,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:50,110 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:26:50,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:50,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:50,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:50,111 INFO 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:26:50,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:50,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:50,123 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:50,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:50,130 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 24 treesize of output 27 [2019-02-25 15:26:50,133 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,134 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 27 treesize of output 33 [2019-02-25 15:26:50,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,138 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 29 treesize of output 43 [2019-02-25 15:26:50,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,147 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 31 treesize of output 57 [2019-02-25 15:26:50,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:50,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,166 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:50,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:50,179 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,224 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,260 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,284 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,302 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,317 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,332 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,392 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:50,393 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,408 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,422 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,439 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,467 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,513 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,560 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:50,560 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:50,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,604 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:50,604 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,645 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:26:50,645 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:50,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:50,673 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:50,674 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:50,712 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:50,713 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:26:50,733 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:26:50,733 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:50,748 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:26:50,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:50,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:26:50,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:50,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:26:50,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:26:50,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:26:50,767 INFO L87 Difference]: Start difference. First operand 939 states and 7156 transitions. Second operand 9 states. [2019-02-25 15:26:51,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:51,901 INFO L93 Difference]: Finished difference Result 1071 states and 7716 transitions. [2019-02-25 15:26:51,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:26:51,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:26:51,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:51,907 INFO L225 Difference]: With dead ends: 1071 [2019-02-25 15:26:51,907 INFO L226 Difference]: Without dead ends: 1070 [2019-02-25 15:26:51,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:26:51,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2019-02-25 15:26:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 995. [2019-02-25 15:26:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-02-25 15:26:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 7604 transitions. [2019-02-25 15:26:52,478 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 7604 transitions. Word has length 6 [2019-02-25 15:26:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:52,478 INFO L480 AbstractCegarLoop]: Abstraction has 995 states and 7604 transitions. [2019-02-25 15:26:52,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:26:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 7604 transitions. [2019-02-25 15:26:52,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:52,480 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:52,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:52,481 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:52,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash 893851214, now seen corresponding path program 1 times [2019-02-25 15:26:52,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:52,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:52,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:52,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:52,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:52,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:52,542 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:26:52,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:52,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:52,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:52,543 INFO L207 CegarAbsIntRunner]: [0], [6], [26], [32], [34], [35] [2019-02-25 15:26:52,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:52,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:52,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:52,546 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:26:52,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:52,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:52,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:52,546 INFO 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:26:52,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:52,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:52,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:26:52,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:52,592 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:52,593 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,609 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,620 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,634 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,657 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,685 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:26:52,722 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:52,724 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:52,726 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:52,730 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:52,732 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:52,740 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:52,741 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,774 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,802 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,824 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,841 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,855 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,868 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:52,934 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:52,935 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:52,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:52,985 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:52,986 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:53,044 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:26:53,044 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:53,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:53,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:53,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:53,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:53,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:53,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:53,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:53,076 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:53,076 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:53,117 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:53,117 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:26:53,139 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:26:53,139 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:53,156 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:26:53,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:53,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:26:53,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:53,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:26:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:26:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:26:53,174 INFO L87 Difference]: Start difference. First operand 995 states and 7604 transitions. Second operand 8 states. [2019-02-25 15:26:54,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:54,191 INFO L93 Difference]: Finished difference Result 1045 states and 7753 transitions. [2019-02-25 15:26:54,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:26:54,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:26:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:54,196 INFO L225 Difference]: With dead ends: 1045 [2019-02-25 15:26:54,196 INFO L226 Difference]: Without dead ends: 1044 [2019-02-25 15:26:54,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:26:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-02-25 15:26:54,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1007. [2019-02-25 15:26:54,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2019-02-25 15:26:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 7700 transitions. [2019-02-25 15:26:54,853 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 7700 transitions. Word has length 6 [2019-02-25 15:26:54,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:54,854 INFO L480 AbstractCegarLoop]: Abstraction has 1007 states and 7700 transitions. [2019-02-25 15:26:54,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:26:54,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 7700 transitions. [2019-02-25 15:26:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:54,856 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:54,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:54,856 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:54,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:54,857 INFO L82 PathProgramCache]: Analyzing trace with hash 893841540, now seen corresponding path program 1 times [2019-02-25 15:26:54,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:54,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:54,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:54,907 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:54,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:54,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:54,907 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:54,907 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [26], [32], [33] [2019-02-25 15:26:54,908 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:54,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:54,909 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:54,909 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:54,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:54,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:54,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:54,910 INFO 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:26:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:54,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:54,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:26:54,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:54,926 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 24 treesize of output 27 [2019-02-25 15:26:54,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,929 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 27 treesize of output 33 [2019-02-25 15:26:54,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,935 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 29 treesize of output 43 [2019-02-25 15:26:54,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,942 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 31 treesize of output 57 [2019-02-25 15:26:54,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:54,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,959 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:54,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:54,972 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:26:54,973 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,011 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,043 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,068 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,087 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,102 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,117 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:26:55,178 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,194 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,206 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,222 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,239 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,270 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,336 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:26:55,337 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:26:55,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,395 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:55,395 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,436 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:55,436 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:26:55,467 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,472 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,474 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,475 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:26:55,475 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,516 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:26:55,516 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:26:55,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:55,553 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:55,554 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:26:55,554 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:55,592 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:55,593 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:26:55,617 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:55,618 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:55,653 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:55,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:55,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:26:55,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:55,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:26:55,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:26:55,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:55,672 INFO L87 Difference]: Start difference. First operand 1007 states and 7700 transitions. Second operand 9 states. [2019-02-25 15:26:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:26:56,965 INFO L93 Difference]: Finished difference Result 1066 states and 7837 transitions. [2019-02-25 15:26:56,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:26:56,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:26:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:26:56,970 INFO L225 Difference]: With dead ends: 1066 [2019-02-25 15:26:56,970 INFO L226 Difference]: Without dead ends: 1064 [2019-02-25 15:26:56,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:26:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-02-25 15:26:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1018. [2019-02-25 15:26:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1018 states. [2019-02-25 15:26:57,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 7788 transitions. [2019-02-25 15:26:57,647 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 7788 transitions. Word has length 6 [2019-02-25 15:26:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:26:57,647 INFO L480 AbstractCegarLoop]: Abstraction has 1018 states and 7788 transitions. [2019-02-25 15:26:57,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:26:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 7788 transitions. [2019-02-25 15:26:57,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:26:57,649 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:26:57,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:26:57,649 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:26:57,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:57,649 INFO L82 PathProgramCache]: Analyzing trace with hash 893847306, now seen corresponding path program 1 times [2019-02-25 15:26:57,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:26:57,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:57,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:57,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:26:57,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:26:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:57,913 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:26:58,155 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-02-25 15:26:58,156 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:58,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:58,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:26:58,156 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:26:58,156 INFO L207 CegarAbsIntRunner]: [0], [6], [26], [28], [32], [33] [2019-02-25 15:26:58,157 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:26:58,157 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:26:58,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:26:58,158 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:26:58,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:26:58,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:26:58,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 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:26:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:26:58,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:26:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:26:58,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:26:58,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:26:58,257 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:26:58,258 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,286 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,309 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,343 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,378 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,418 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,468 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,522 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:26:58,527 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:26:58,530 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:26:58,532 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:26:58,535 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:26:58,539 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:26:58,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:26:58,542 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,590 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,618 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,640 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,657 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,672 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,685 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,750 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:26:58,750 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:26:58,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:58,785 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,845 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:26:58,846 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:26:58,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:26:58,888 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:58,947 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:58,947 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:76 [2019-02-25 15:26:58,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,986 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:26:58,989 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:26:58,990 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:26:58,991 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:26:59,047 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:26:59,047 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:88, output treesize:66 [2019-02-25 15:26:59,075 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:59,075 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:26:59,128 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:59,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:26:59,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:26:59,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:26:59,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:26:59,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:26:59,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:26:59,147 INFO L87 Difference]: Start difference. First operand 1018 states and 7788 transitions. Second operand 10 states. [2019-02-25 15:27:00,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:00,857 INFO L93 Difference]: Finished difference Result 1310 states and 9587 transitions. [2019-02-25 15:27:00,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:27:00,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:27:00,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:00,863 INFO L225 Difference]: With dead ends: 1310 [2019-02-25 15:27:00,863 INFO L226 Difference]: Without dead ends: 1307 [2019-02-25 15:27:00,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:27:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2019-02-25 15:27:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1139. [2019-02-25 15:27:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-02-25 15:27:01,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 8742 transitions. [2019-02-25 15:27:01,743 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 8742 transitions. Word has length 6 [2019-02-25 15:27:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:01,744 INFO L480 AbstractCegarLoop]: Abstraction has 1139 states and 8742 transitions. [2019-02-25 15:27:01,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:27:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 8742 transitions. [2019-02-25 15:27:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:27:01,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:01,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:27:01,746 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:01,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash 893833852, now seen corresponding path program 1 times [2019-02-25 15:27:01,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:01,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:01,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:01,798 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:01,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:01,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:01,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:27:01,798 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [26], [32], [33] [2019-02-25 15:27:01,799 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:01,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:01,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:01,801 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:01,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:01,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:01,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:27:01,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:01,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:01,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:01,817 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:27:01,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:01,870 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:27:01,871 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:01,889 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:01,901 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:01,916 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:01,944 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:01,985 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,028 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:27:02,030 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:27:02,033 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:27:02,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:27:02,039 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:27:02,041 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:27:02,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:27:02,055 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,092 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,120 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,141 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,159 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,173 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,186 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,232 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:02,233 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:27:02,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,293 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:02,294 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,335 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:02,336 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:27:02,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,370 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:02,370 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,409 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:02,410 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:27:02,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:02,449 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:02,450 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:27:02,450 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:02,489 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:02,490 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:27:02,514 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:02,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:02,550 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:02,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:02,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:27:02,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:02,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:27:02,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:27:02,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:27:02,568 INFO L87 Difference]: Start difference. First operand 1139 states and 8742 transitions. Second operand 9 states. [2019-02-25 15:27:03,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:03,979 INFO L93 Difference]: Finished difference Result 1186 states and 8852 transitions. [2019-02-25 15:27:03,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:27:03,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:27:03,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:03,985 INFO L225 Difference]: With dead ends: 1186 [2019-02-25 15:27:03,985 INFO L226 Difference]: Without dead ends: 1185 [2019-02-25 15:27:03,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:27:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-02-25 15:27:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1148. [2019-02-25 15:27:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-02-25 15:27:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 8814 transitions. [2019-02-25 15:27:04,844 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 8814 transitions. Word has length 6 [2019-02-25 15:27:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:04,844 INFO L480 AbstractCegarLoop]: Abstraction has 1148 states and 8814 transitions. [2019-02-25 15:27:04,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:27:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 8814 transitions. [2019-02-25 15:27:04,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:27:04,847 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:04,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:27:04,847 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:04,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 893893434, now seen corresponding path program 1 times [2019-02-25 15:27:04,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:04,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:04,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:04,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:04,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:05,063 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:05,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:05,064 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:05,064 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:27:05,064 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [32], [33] [2019-02-25 15:27:05,065 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:05,065 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:05,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:05,066 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:05,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:05,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:05,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:05,067 INFO 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:27:05,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:05,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:05,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:27:05,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:05,134 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:27:05,134 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,158 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,168 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,181 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,204 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,240 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,283 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,334 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:27:05,337 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:27:05,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:27:05,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, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:27:05,346 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:27:05,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:27:05,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:27:05,352 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,405 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,433 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,455 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,473 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,487 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,501 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,565 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:05,565 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 5 variables, input treesize:118, output treesize:120 [2019-02-25 15:27:05,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:27:05,597 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,657 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:05,657 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:130, output treesize:96 [2019-02-25 15:27:05,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,696 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:05,697 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:27:05,698 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,772 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:05,773 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:80 [2019-02-25 15:27:05,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,809 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,810 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:05,810 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:05,812 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:27:05,813 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:05,931 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:05,932 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:90, output treesize:72 [2019-02-25 15:27:05,982 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:05,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:06,018 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:06,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:06,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:27:06,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:06,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:27:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:27:06,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:27:06,037 INFO L87 Difference]: Start difference. First operand 1148 states and 8814 transitions. Second operand 9 states. [2019-02-25 15:27:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:09,824 INFO L93 Difference]: Finished difference Result 1194 states and 8890 transitions. [2019-02-25 15:27:09,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:27:09,825 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:27:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:09,830 INFO L225 Difference]: With dead ends: 1194 [2019-02-25 15:27:09,830 INFO L226 Difference]: Without dead ends: 1193 [2019-02-25 15:27:09,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:27:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2019-02-25 15:27:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1150. [2019-02-25 15:27:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-02-25 15:27:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 8830 transitions. [2019-02-25 15:27:10,673 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 8830 transitions. Word has length 6 [2019-02-25 15:27:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:10,673 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 8830 transitions. [2019-02-25 15:27:10,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:27:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 8830 transitions. [2019-02-25 15:27:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:27:10,675 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:10,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:27:10,675 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash 908389222, now seen corresponding path program 1 times [2019-02-25 15:27:10,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:10,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:10,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:10,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:10,712 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:27:10,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:10,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:10,713 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:27:10,713 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [34], [35] [2019-02-25 15:27:10,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:10,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:10,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:10,716 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:10,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:10,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:10,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:10,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 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:27:10,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:10,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:10,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:27:10,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:10,740 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 24 treesize of output 27 [2019-02-25 15:27:10,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,743 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 27 treesize of output 33 [2019-02-25 15:27:10,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-02-25 15:27:10,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,779 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,782 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 31 treesize of output 49 [2019-02-25 15:27:10,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-25 15:27:10,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:10,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-02-25 15:27:10,814 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-02-25 15:27:10,815 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:10,851 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:10,878 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:10,898 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:10,913 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:10,929 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:10,944 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:10,993 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 13 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:10,994 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:11,006 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:11,021 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:11,040 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:11,063 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:11,104 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:11,105 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:84, output treesize:88 [2019-02-25 15:27:11,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,147 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:27:11,148 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:11,184 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:11,184 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:93, output treesize:63 [2019-02-25 15:27:11,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:11,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-02-25 15:27:11,216 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:11,249 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:11,250 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:47 [2019-02-25 15:27:11,272 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:27:11,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:11,291 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:27:11,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:11,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:27:11,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:11,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:27:11,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:27:11,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:27:11,311 INFO L87 Difference]: Start difference. First operand 1150 states and 8830 transitions. Second operand 8 states. [2019-02-25 15:27:12,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:12,495 INFO L93 Difference]: Finished difference Result 1188 states and 8868 transitions. [2019-02-25 15:27:12,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:27:12,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:27:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:12,501 INFO L225 Difference]: With dead ends: 1188 [2019-02-25 15:27:12,501 INFO L226 Difference]: Without dead ends: 1187 [2019-02-25 15:27:12,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:27:12,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2019-02-25 15:27:13,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1150. [2019-02-25 15:27:13,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1150 states. [2019-02-25 15:27:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 8830 transitions. [2019-02-25 15:27:13,394 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 8830 transitions. Word has length 6 [2019-02-25 15:27:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:13,394 INFO L480 AbstractCegarLoop]: Abstraction has 1150 states and 8830 transitions. [2019-02-25 15:27:13,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:27:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 8830 transitions. [2019-02-25 15:27:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:27:13,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:13,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:27:13,396 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:13,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash 908363984, now seen corresponding path program 1 times [2019-02-25 15:27:13,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:13,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:13,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:13,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:13,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:13,545 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:13,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:13,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:13,545 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:27:13,545 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [26], [31] [2019-02-25 15:27:13,546 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:13,546 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:13,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:13,547 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:13,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:13,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:13,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:13,548 INFO 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:27:13,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:13,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:13,561 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:27:13,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:13,567 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 24 treesize of output 27 [2019-02-25 15:27:13,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,571 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 27 treesize of output 33 [2019-02-25 15:27:13,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,576 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 29 treesize of output 43 [2019-02-25 15:27:13,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,585 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 31 treesize of output 57 [2019-02-25 15:27:13,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,592 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:27:13,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:13,602 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:27:13,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:27:13,613 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,654 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,685 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,710 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,727 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,744 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,757 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,814 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:27:13,815 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,832 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,842 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,861 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,882 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:13,910 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,956 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:13,956 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:27:14,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,018 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:14,019 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:14,060 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:14,060 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:27:14,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,094 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:14,095 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:14,134 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:14,135 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:27:14,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,164 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,170 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:14,171 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:27:14,171 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:14,211 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:14,211 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:27:14,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,242 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,243 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,244 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,246 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:14,247 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:14,247 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:27:14,248 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:14,285 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:14,285 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:27:14,308 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:14,308 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:14,341 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:27:14,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:14,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-02-25 15:27:14,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:14,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:27:14,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:27:14,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:27:14,360 INFO L87 Difference]: Start difference. First operand 1150 states and 8830 transitions. Second operand 12 states. [2019-02-25 15:27:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:16,363 INFO L93 Difference]: Finished difference Result 1387 states and 10137 transitions. [2019-02-25 15:27:16,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:27:16,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:27:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:16,369 INFO L225 Difference]: With dead ends: 1387 [2019-02-25 15:27:16,370 INFO L226 Difference]: Without dead ends: 1385 [2019-02-25 15:27:16,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:27:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-02-25 15:27:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1178. [2019-02-25 15:27:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1178 states. [2019-02-25 15:27:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 9054 transitions. [2019-02-25 15:27:17,298 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 9054 transitions. Word has length 6 [2019-02-25 15:27:17,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:17,298 INFO L480 AbstractCegarLoop]: Abstraction has 1178 states and 9054 transitions. [2019-02-25 15:27:17,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:27:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 9054 transitions. [2019-02-25 15:27:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:27:17,300 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:17,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:27:17,301 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:17,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 908367890, now seen corresponding path program 1 times [2019-02-25 15:27:17,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:17,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:17,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:17,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:17,422 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:17,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:17,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:17,423 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:27:17,423 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [31] [2019-02-25 15:27:17,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:17,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:17,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:17,426 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:17,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:17,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:17,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:17,428 INFO 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:27:17,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:17,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:17,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:27:17,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:17,572 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-02-25 15:27:17,573 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,595 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,608 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,625 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,644 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,675 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,718 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,769 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:27:17,772 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:27:17,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:27:17,776 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:27:17,779 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:27:17,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, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:27:17,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-02-25 15:27:17,786 INFO L301 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,836 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,864 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,886 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,904 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,918 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,932 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:17,996 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:27:17,996 INFO L208 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:118, output treesize:120 [2019-02-25 15:27:18,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,044 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:27:18,045 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:18,105 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:18,105 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:130, output treesize:96 [2019-02-25 15:27:18,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,148 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,151 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,152 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,154 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-02-25 15:27:18,155 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:18,215 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:18,215 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:76 [2019-02-25 15:27:18,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,257 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,258 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,260 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,262 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:18,263 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 122 [2019-02-25 15:27:18,263 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:18,319 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:18,319 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:88, output treesize:66 [2019-02-25 15:27:18,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:18,369 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:18,370 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 124 [2019-02-25 15:27:18,371 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:18,427 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:18,427 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:78, output treesize:60 [2019-02-25 15:27:18,453 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:18,453 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:18,529 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:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:18,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:27:18,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:18,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:27:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:27:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:27:18,549 INFO L87 Difference]: Start difference. First operand 1178 states and 9054 transitions. Second operand 12 states. [2019-02-25 15:27:21,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:21,527 INFO L93 Difference]: Finished difference Result 1420 states and 10581 transitions. [2019-02-25 15:27:21,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:27:21,527 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:27:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:21,534 INFO L225 Difference]: With dead ends: 1420 [2019-02-25 15:27:21,534 INFO L226 Difference]: Without dead ends: 1415 [2019-02-25 15:27:21,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:27:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2019-02-25 15:27:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1276. [2019-02-25 15:27:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-02-25 15:27:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 9825 transitions. [2019-02-25 15:27:22,436 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 9825 transitions. Word has length 6 [2019-02-25 15:27:22,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:22,437 INFO L480 AbstractCegarLoop]: Abstraction has 1276 states and 9825 transitions. [2019-02-25 15:27:22,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:27:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 9825 transitions. [2019-02-25 15:27:22,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:27:22,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:22,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:27:22,439 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:22,439 INFO L82 PathProgramCache]: Analyzing trace with hash 908371176, now seen corresponding path program 1 times [2019-02-25 15:27:22,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:22,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:22,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:22,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:22,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:22,528 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:22,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:22,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:22,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:27:22,528 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [31] [2019-02-25 15:27:22,529 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:22,529 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:22,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:22,531 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:22,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:22,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:22,532 INFO 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:27:22,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:22,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:22,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:27:22,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:22,595 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:27:22,595 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,617 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,632 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,658 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,696 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,736 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:22,783 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 treesize of output 27 [2019-02-25 15:27:22,785 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-02-25 15:27:22,787 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-02-25 15:27:22,806 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-25 15:27:22,823 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:27:22,840 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:27:22,981 INFO L292 Elim1Store]: Index analysis took 139 ms [2019-02-25 15:27:22,982 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:27:22,983 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,103 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,131 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,153 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,170 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,183 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,197 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,243 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:27:23,243 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:95, output treesize:96 [2019-02-25 15:27:23,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,317 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:23,318 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,359 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:23,359 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:27:23,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:23,403 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,443 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:23,443 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:27:23,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,479 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 L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:23,486 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:27:23,487 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,526 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:23,526 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:27:23,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,564 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:23,565 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:23,566 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:27:23,566 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:23,604 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:23,604 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:27:23,629 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,629 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:23,690 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:23,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:23,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:27:23,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:23,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:27:23,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:27:23,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:27:23,709 INFO L87 Difference]: Start difference. First operand 1276 states and 9825 transitions. Second operand 12 states. [2019-02-25 15:27:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:27:25,428 INFO L93 Difference]: Finished difference Result 1449 states and 10752 transitions. [2019-02-25 15:27:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:27:25,428 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:27:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:27:25,434 INFO L225 Difference]: With dead ends: 1449 [2019-02-25 15:27:25,434 INFO L226 Difference]: Without dead ends: 1448 [2019-02-25 15:27:25,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:27:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-02-25 15:27:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1378. [2019-02-25 15:27:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1378 states. [2019-02-25 15:27:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 10640 transitions. [2019-02-25 15:27:26,380 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 10640 transitions. Word has length 6 [2019-02-25 15:27:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:27:26,380 INFO L480 AbstractCegarLoop]: Abstraction has 1378 states and 10640 transitions. [2019-02-25 15:27:26,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:27:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 10640 transitions. [2019-02-25 15:27:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:27:26,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:27:26,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:27:26,383 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:27:26,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:26,383 INFO L82 PathProgramCache]: Analyzing trace with hash 908017528, now seen corresponding path program 1 times [2019-02-25 15:27:26,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:27:26,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:26,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:26,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:27:26,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:27:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:26,473 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:26,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:26,473 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:27:26,473 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:27:26,474 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [31] [2019-02-25 15:27:26,474 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:27:26,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:27:26,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:27:26,476 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 2. Performed 80 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:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:27:26,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:27:26,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:27:26,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:27:26,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:27:26,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:27:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:27:26,490 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:27:26,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:27:26,494 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 24 treesize of output 27 [2019-02-25 15:27:26,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,498 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 27 treesize of output 33 [2019-02-25 15:27:26,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,503 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 29 treesize of output 43 [2019-02-25 15:27:26,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,509 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 31 treesize of output 57 [2019-02-25 15:27:26,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,520 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-02-25 15:27:26,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,526 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,530 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-02-25 15:27:26,544 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-02-25 15:27:26,545 INFO L301 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,585 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,617 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,640 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,659 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,675 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,713 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,766 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-25 15:27:26,767 INFO L301 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,781 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,791 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,809 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,830 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,857 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:27:26,904 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:26,904 INFO L208 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-02-25 15:27:26,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:26,962 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:26,962 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:27,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:27:27,002 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:27:27,032 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,037 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:27,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:27,038 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:27,076 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:27,077 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-25 15:27:27,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,111 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,114 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:27:27,115 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:27,154 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:27,154 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-25 15:27:27,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:27:27,189 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:27:27,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:27:27,191 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:27:27,230 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-25 15:27:27,230 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:27:27,251 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:27,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:27:27,302 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:27:27,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:27:27,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:27:27,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:27:27,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:27:27,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:27:27,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:27:27,320 INFO L87 Difference]: Start difference. First operand 1378 states and 10640 transitions. Second operand 12 states. [2019-02-25 15:27:30,058 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-25 15:27:30,059 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-02-25 15:27:30,063 INFO L168 Benchmark]: Toolchain (without parser) took 267810.34 ms. Allocated memory was 137.4 MB in the beginning and 921.2 MB in the end (delta: 783.8 MB). Free memory was 104.8 MB in the beginning and 623.3 MB in the end (delta: -518.5 MB). Peak memory consumption was 265.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:30,063 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:27:30,064 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.37 ms. Allocated memory is still 137.4 MB. Free memory was 104.4 MB in the beginning and 102.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:30,064 INFO L168 Benchmark]: Boogie Preprocessor took 36.22 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 101.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:30,064 INFO L168 Benchmark]: RCFGBuilder took 571.81 ms. Allocated memory is still 137.4 MB. Free memory was 101.0 MB in the beginning and 88.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:30,064 INFO L168 Benchmark]: TraceAbstraction took 267136.31 ms. Allocated memory was 137.4 MB in the beginning and 921.2 MB in the end (delta: 783.8 MB). Free memory was 88.5 MB in the beginning and 623.3 MB in the end (delta: -534.8 MB). Peak memory consumption was 249.0 MB. Max. memory is 7.1 GB. [2019-02-25 15:27:30,065 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 137.4 MB. Free memory is still 105.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.37 ms. Allocated memory is still 137.4 MB. Free memory was 104.4 MB in the beginning and 102.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.22 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 101.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 571.81 ms. Allocated memory is still 137.4 MB. Free memory was 101.0 MB in the beginning and 88.5 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 267136.31 ms. Allocated memory was 137.4 MB in the beginning and 921.2 MB in the end (delta: 783.8 MB). Free memory was 88.5 MB in the beginning and 623.3 MB in the end (delta: -534.8 MB). Peak memory consumption was 249.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...