java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:51:54,893 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:51:54,897 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:51:54,911 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:51:54,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:51:54,913 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:51:54,914 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:51:54,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:51:54,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:51:54,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:51:54,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:51:54,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:51:54,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:51:54,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:51:54,923 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:51:54,924 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:51:54,925 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:51:54,926 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:51:54,929 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:51:54,930 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:51:54,931 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:51:54,932 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:51:54,935 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:51:54,935 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:51:54,935 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:51:54,936 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:51:54,938 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:51:54,938 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:51:54,939 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:51:54,940 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:51:54,941 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:51:54,941 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:51:54,942 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:51:54,942 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:51:54,943 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:51:54,944 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:51:54,944 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:51:54,960 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:51:54,960 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:51:54,961 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:51:54,961 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:51:54,961 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:51:54,962 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:51:54,962 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:51:54,962 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:51:54,962 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:51:54,962 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:51:54,963 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:51:54,963 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:51:54,963 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:51:54,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:51:54,964 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:51:54,964 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:51:54,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:51:54,965 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:51:54,965 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:51:54,965 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:51:54,965 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:51:54,965 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:51:54,966 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:51:54,966 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:51:54,966 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:51:54,966 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:51:54,966 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:51:54,967 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:51:54,967 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:51:54,967 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:51:54,967 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:51:54,967 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:51:54,968 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:51:54,968 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:51:54,968 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:51:54,968 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:51:54,968 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:51:54,969 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:51:54,969 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:51:54,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:51:55,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:51:55,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:51:55,018 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:51:55,019 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:51:55,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-02-25 15:51:55,020 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-02-25 15:51:55,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:51:55,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:51:55,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:55,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:51:55,068 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:51:55,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,098 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,125 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:55,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:51:55,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:51:55,126 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:51:55,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,139 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,149 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/1) ... [2019-02-25 15:51:55,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:51:55,159 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:51:55,159 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:51:55,160 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:51:55,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (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:51:55,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:51:55,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:51:55,735 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:51:55,735 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-25 15:51:55,736 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:55 BoogieIcfgContainer [2019-02-25 15:51:55,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:51:55,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:51:55,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:51:55,744 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:51:55,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:55" (1/2) ... [2019-02-25 15:51:55,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79353b81 and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:51:55, skipping insertion in model container [2019-02-25 15:51:55,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:55" (2/2) ... [2019-02-25 15:51:55,747 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-02-25 15:51:55,761 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:51:55,769 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-25 15:51:55,787 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-25 15:51:55,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:51:55,819 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:51:55,819 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:51:55,819 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:51:55,819 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:51:55,820 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:51:55,820 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:51:55,820 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:51:55,834 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-25 15:51:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:51:55,840 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:55,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:51:55,844 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:55,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-25 15:51:55,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:55,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:55,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:55,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:56,035 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:51:56,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:56,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:51:56,038 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:56,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:51:56,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:51:56,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:56,060 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-25 15:51:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:56,252 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-25 15:51:56,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:56,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:51:56,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:56,268 INFO L225 Difference]: With dead ends: 29 [2019-02-25 15:51:56,268 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:51:56,271 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:51:56,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:51:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-25 15:51:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:51:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-25 15:51:56,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-25 15:51:56,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:56,304 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-25 15:51:56,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:51:56,304 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-25 15:51:56,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:56,305 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:56,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:56,306 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:56,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-25 15:51:56,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:56,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:56,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:56,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:56,419 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:51:56,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:56,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:56,421 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:56,423 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-25 15:51:56,500 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:56,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:57,548 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:57,549 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:57,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:57,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:57,556 INFO 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:51:57,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:57,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:57,597 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:51:57,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:57,862 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:51:57,864 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,028 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,117 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,270 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,514 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,593 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 21 treesize of output 24 [2019-02-25 15:51:58,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:51:58,615 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:51:58,641 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:51:58,661 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 30 treesize of output 72 [2019-02-25 15:51:58,743 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:51:58,745 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,872 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,945 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:58,973 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,043 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,066 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,177 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:51:59,177 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:51:59,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:59,359 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:51:59,360 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:59,400 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:51:59,401 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:51:59,467 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:51:59,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:59,499 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:51:59,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:59,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:59,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:59,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:59,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:59,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:59,524 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-02-25 15:51:59,854 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-02-25 15:52:00,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:00,118 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-02-25 15:52:00,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:00,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:52:00,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:00,121 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:52:00,121 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:52:00,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:52:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:52:00,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-02-25 15:52:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:52:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-02-25 15:52:00,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-02-25 15:52:00,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:00,129 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-02-25 15:52:00,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:00,129 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-02-25 15:52:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:00,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:00,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:00,130 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-25 15:52:00,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:00,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:00,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:00,224 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:52:00,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:00,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:00,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:00,225 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-25 15:52:00,228 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:00,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:00,707 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:00,708 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:00,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:00,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:00,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:00,708 INFO 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:52:00,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:00,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:00,744 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:00,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:00,767 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 21 treesize of output 24 [2019-02-25 15:52:00,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,807 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 24 treesize of output 30 [2019-02-25 15:52:00,855 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,878 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 26 treesize of output 40 [2019-02-25 15:52:00,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:00,961 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 28 treesize of output 54 [2019-02-25 15:52:00,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:01,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:01,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:01,062 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:01,064 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 30 treesize of output 72 [2019-02-25 15:52:01,193 INFO L292 Elim1Store]: Index analysis took 126 ms [2019-02-25 15:52:01,195 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:01,196 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,252 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,278 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,353 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,368 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,408 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,485 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:01,485 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,508 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,518 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,531 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,552 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,592 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:52:01,593 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:01,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:01,722 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:01,723 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:01,796 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:52:01,796 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:01,829 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:52:01,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:01,843 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:52:01,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:52:01,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:52:01,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:01,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:01,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:01,865 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-02-25 15:52:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:01,931 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-02-25 15:52:01,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:01,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:52:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:01,933 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:52:01,934 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:52:01,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:52:01,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-25 15:52:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:52:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-02-25 15:52:01,941 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-02-25 15:52:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:01,941 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-02-25 15:52:01,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-02-25 15:52:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:01,942 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:01,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:01,943 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:01,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:01,943 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-25 15:52:01,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:01,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:01,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:01,945 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:02,044 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:52:02,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:02,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:02,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:02,045 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-25 15:52:02,046 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:02,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:04,797 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:04,798 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:04,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:04,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:04,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:04,800 INFO 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:52:04,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:04,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:04,841 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:52:04,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:04,914 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:52:04,915 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,943 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,957 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,977 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:04,997 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,028 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:52:05,072 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 24 treesize of output 30 [2019-02-25 15:52:05,078 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 26 treesize of output 40 [2019-02-25 15:52:05,093 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 28 treesize of output 54 [2019-02-25 15:52:05,104 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 30 treesize of output 72 [2019-02-25 15:52:05,109 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:05,109 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52: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:52:05,171 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,188 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,202 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,216 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,265 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:52:05,266 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:05,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,298 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:52:05,299 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:05,347 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:52:05,348 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:05,365 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:52:05,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:05,385 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:52:05,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:05,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:05,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:05,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:05,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:05,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:05,406 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-02-25 15:52:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:05,611 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-02-25 15:52:05,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:05,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:52:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:05,614 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:52:05,614 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:52:05,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:05,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:52:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-02-25 15:52:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:52:05,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-02-25 15:52:05,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-02-25 15:52:05,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:05,622 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-02-25 15:52:05,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-02-25 15:52:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:52:05,622 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:05,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:52:05,623 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:05,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-25 15:52:05,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:05,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:05,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:05,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:05,675 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:52:05,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:05,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:05,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:52:05,676 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-25 15:52:05,679 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:05,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:05,916 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:05,916 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:05,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:05,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:05,917 INFO 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:52:05,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:05,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:05,953 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:05,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:05,958 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 21 treesize of output 24 [2019-02-25 15:52:05,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,964 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:52:05,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,975 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 26 treesize of output 40 [2019-02-25 15:52:05,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:05,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:05,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,004 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 30 treesize of output 72 [2019-02-25 15:52:06,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:06,021 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,093 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,127 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,161 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,175 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,206 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,300 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:06,302 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,313 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,321 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,334 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,353 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,388 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:52:06,388 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:06,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:06,431 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:06,432 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:06,460 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:52:06,460 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:06,520 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:52:06,521 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:06,533 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:52:06,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:06,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:06,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:06,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:06,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:06,554 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-02-25 15:52:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:06,717 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-02-25 15:52:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:06,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:52:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:06,719 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:52:06,719 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:52:06,719 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:52:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:52:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-02-25 15:52:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:52:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-02-25 15:52:06,726 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-02-25 15:52:06,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:06,726 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-02-25 15:52:06,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:06,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-02-25 15:52:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:06,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:06,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:06,728 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:06,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:06,728 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-02-25 15:52:06,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:06,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:06,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:06,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:06,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:06,790 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:52:06,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:06,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:06,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:06,791 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-02-25 15:52:06,794 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:06,794 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:07,158 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:07,158 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:07,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:07,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:07,159 INFO 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:52:07,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:07,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:07,192 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:07,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:07,212 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 21 treesize of output 24 [2019-02-25 15:52:07,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,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 24 treesize of output 30 [2019-02-25 15:52:07,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,228 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,229 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 26 treesize of output 40 [2019-02-25 15:52:07,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,242 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 28 treesize of output 54 [2019-02-25 15:52:07,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,273 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 30 treesize of output 72 [2019-02-25 15:52:07,292 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:07,293 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,331 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,358 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,379 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,393 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,407 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,461 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:07,462 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,473 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,484 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,497 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,519 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,558 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:52:07,559 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:07,612 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:07,614 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,641 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:52:07,642 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:07,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:07,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:07,689 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:07,716 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:52:07,716 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:07,736 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:52:07,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:07,760 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:52:07,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:07,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:07,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:07,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:07,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:07,782 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-02-25 15:52:08,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:08,223 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-02-25 15:52:08,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:08,224 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:08,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:08,226 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:52:08,226 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:52:08,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:52:08,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-25 15:52:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:52:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-02-25 15:52:08,235 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-02-25 15:52:08,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:08,235 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-02-25 15:52:08,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:08,236 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-02-25 15:52:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:08,236 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:08,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:08,237 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:08,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:08,237 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-02-25 15:52:08,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:08,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:08,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:08,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:08,318 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:52:08,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:08,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:08,319 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:08,319 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-02-25 15:52:08,320 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:08,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:08,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:08,670 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:08,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:08,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:08,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:08,671 INFO 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:52:08,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:08,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:08,705 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:52:08,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:08,783 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:52:08,783 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,820 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,831 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,852 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,888 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,923 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:08,993 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 21 treesize of output 24 [2019-02-25 15:52:09,009 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 24 treesize of output 30 [2019-02-25 15:52:09,012 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:52:09,018 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 28 treesize of output 54 [2019-02-25 15:52:09,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 30 treesize of output 72 [2019-02-25 15:52:09,029 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:09,030 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,086 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,113 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,137 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,155 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,176 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,227 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:52:09,227 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:09,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,298 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:52:09,299 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,413 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:52:09,414 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:09,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:09,450 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:09,452 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:52:09,453 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:09,494 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:52:09,495 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:52:09,518 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:52:09,519 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:09,545 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:52:09,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:09,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:09,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:09,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:09,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:09,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:09,566 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-02-25 15:52:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:10,066 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-02-25 15:52:10,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:10,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:10,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:10,068 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:52:10,068 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:52:10,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:10,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:52:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-25 15:52:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:52:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-02-25 15:52:10,078 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-02-25 15:52:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:10,078 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-02-25 15:52:10,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:10,079 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-02-25 15:52:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:10,079 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:10,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:10,080 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:10,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:10,080 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-02-25 15:52:10,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:10,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:10,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:10,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:10,194 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:52:10,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:10,195 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:10,195 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-02-25 15:52:10,197 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:10,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:10,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:10,496 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:10,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:10,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:10,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:10,497 INFO 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:52:10,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:10,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:10,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:10,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:10,534 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 21 treesize of output 24 [2019-02-25 15:52:10,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,574 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:52:10,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:52:10,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,590 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 28 treesize of output 54 [2019-02-25 15:52:10,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,605 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 30 treesize of output 72 [2019-02-25 15:52:10,620 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:10,621 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,655 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,680 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,700 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,716 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,729 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,779 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:10,780 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,790 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,801 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,832 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,853 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:10,890 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:52:10,891 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:10,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:10,990 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:10,991 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,020 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:52:11,021 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:11,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:11,051 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:11,052 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:11,053 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:11,079 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:52:11,079 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-25 15:52:11,095 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:52:11,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:11,128 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:52:11,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:11,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:11,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:11,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:11,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:11,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:11,149 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-02-25 15:52:11,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:11,539 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-02-25 15:52:11,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:11,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:11,541 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:52:11,541 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:52:11,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:11,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:52:11,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-25 15:52:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:52:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-02-25 15:52:11,551 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-02-25 15:52:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:11,551 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-02-25 15:52:11,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-02-25 15:52:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:11,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:11,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:11,552 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-02-25 15:52:11,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:11,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:11,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:11,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:11,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:11,675 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:52:11,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:11,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:11,676 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:11,676 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-02-25 15:52:11,677 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:11,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:11,969 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:11,969 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:11,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:11,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:11,970 INFO 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:52:11,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:11,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:11,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:11,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:12,038 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:12,039 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,051 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,060 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,072 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,091 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,118 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 21 treesize of output 24 [2019-02-25 15:52:12,121 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 24 treesize of output 30 [2019-02-25 15:52:12,124 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:52:12,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:12,136 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 30 treesize of output 72 [2019-02-25 15:52:12,154 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:12,155 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,189 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,212 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,226 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,239 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,251 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,282 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:52:12,283 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:12,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,379 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:12,380 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,748 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:52:12,748 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:12,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:12,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:12,803 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:12,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:52:12,831 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:12,849 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:52:12,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:12,875 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:52:12,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:12,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:12,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:12,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:12,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:12,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:12,897 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-02-25 15:52:13,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:13,324 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-02-25 15:52:13,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:13,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:13,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:13,326 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:52:13,326 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:52:13,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:52:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-02-25 15:52:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:52:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-02-25 15:52:13,339 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-02-25 15:52:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:13,339 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-02-25 15:52:13,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-02-25 15:52:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:13,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:13,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:13,340 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-02-25 15:52:13,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:13,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:13,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:13,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:13,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:13,421 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:52:13,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:13,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:13,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:13,423 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-02-25 15:52:13,426 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:13,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:13,670 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:13,670 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:13,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:13,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:13,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:13,671 INFO 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:52:13,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:13,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:13,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:13,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:13,733 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:13,734 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,791 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,798 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,807 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,827 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,853 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 21 treesize of output 24 [2019-02-25 15:52:13,856 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 24 treesize of output 30 [2019-02-25 15:52:13,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:52:13,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:13,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:52:13,875 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:13,876 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,904 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,923 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,940 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,954 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:13,965 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,005 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:52:14,006 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:14,078 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,079 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:14,079 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,121 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:52:14,122 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:14,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,145 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,153 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,155 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:14,156 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:14,156 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:14,198 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:52:14,198 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:52:14,224 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:52:14,225 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:14,253 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:52:14,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:14,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:14,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:14,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:14,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:14,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:14,274 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-02-25 15:52:14,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:14,643 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-02-25 15:52:14,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:14,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:14,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:14,645 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:52:14,645 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:52:14,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:52:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-02-25 15:52:14,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:52:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-02-25 15:52:14,657 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-02-25 15:52:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:14,658 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-02-25 15:52:14,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-02-25 15:52:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:14,659 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:14,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:14,659 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-02-25 15:52:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:14,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:14,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:14,718 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:52:14,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:14,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:14,719 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:14,719 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-02-25 15:52:14,721 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:14,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:14,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:14,929 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:14,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:14,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:14,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:14,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:14,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:14,955 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:52:14,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:14,971 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 21 treesize of output 24 [2019-02-25 15:52:15,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,012 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 24 treesize of output 30 [2019-02-25 15:52:15,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,032 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 26 treesize of output 40 [2019-02-25 15:52:15,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,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 28 treesize of output 54 [2019-02-25 15:52:15,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,056 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 30 treesize of output 72 [2019-02-25 15:52:15,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:15,066 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,098 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,121 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,138 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,154 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,167 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,211 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:15,212 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,223 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,229 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,240 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,258 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,293 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:52:15,293 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:15,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:15,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:15,339 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:15,369 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:52:15,370 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:15,384 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:52:15,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:15,394 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:52:15,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:15,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:15,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:15,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:15,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:15,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:15,415 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-02-25 15:52:15,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:15,913 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-02-25 15:52:15,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:15,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:52:15,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:15,915 INFO L225 Difference]: With dead ends: 56 [2019-02-25 15:52:15,915 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:52:15,916 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:52:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:52:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-02-25 15:52:15,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:52:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-02-25 15:52:15,926 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-02-25 15:52:15,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:15,926 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-02-25 15:52:15,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-02-25 15:52:15,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:15,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:15,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:15,928 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-02-25 15:52:15,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:15,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:15,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:15,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:16,002 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:52:16,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:16,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:16,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:16,003 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-02-25 15:52:16,004 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:16,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:16,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:16,341 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:16,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:16,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:16,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:16,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:16,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:16,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:16,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:52:16,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:16,438 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:52:16,438 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,467 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,481 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,505 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,532 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,566 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,605 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 21 treesize of output 24 [2019-02-25 15:52:16,608 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 24 treesize of output 30 [2019-02-25 15:52:16,613 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 26 treesize of output 40 [2019-02-25 15:52:16,634 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 28 treesize of output 54 [2019-02-25 15:52:16,643 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 30 treesize of output 72 [2019-02-25 15:52:16,646 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:16,647 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,722 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,741 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,760 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,773 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,786 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,834 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:52:16,834 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:16,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:16,902 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:52:16,902 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:16,975 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:52:16,975 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:16,999 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:17,017 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:52:17,017 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:17,060 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:52:17,060 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-25 15:52:17,199 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:52:17,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:17,218 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:52:17,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:17,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:52:17,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:17,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:17,238 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-02-25 15:52:17,525 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-02-25 15:52:17,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:17,939 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-02-25 15:52:17,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:17,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:17,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:17,941 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:52:17,941 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:52:17,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:52:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-02-25 15:52:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:52:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-02-25 15:52:17,955 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-02-25 15:52:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:17,955 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-02-25 15:52:17,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-02-25 15:52:17,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:17,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:17,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:17,957 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:17,957 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-02-25 15:52:17,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:17,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:17,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:17,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:18,053 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:52:18,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:18,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:18,053 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-02-25 15:52:18,055 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:18,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:18,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:18,278 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:18,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:18,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:18,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:18,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 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:52:18,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:18,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:18,294 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:18,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:18,302 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 21 treesize of output 24 [2019-02-25 15:52:18,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,307 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 24 treesize of output 30 [2019-02-25 15:52:18,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,317 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 26 treesize of output 40 [2019-02-25 15:52:18,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,327 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 28 treesize of output 54 [2019-02-25 15:52:18,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,338 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 30 treesize of output 72 [2019-02-25 15:52:18,360 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:18,361 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,393 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,417 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,435 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,449 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,462 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:18,516 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,527 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,537 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,554 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,573 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,612 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:52:18,612 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:18,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,673 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:18,673 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,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:52:18,706 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:18,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:18,752 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:18,753 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:18,779 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:52:18,780 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:52:18,805 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:52:18,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:18,828 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:52:18,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:18,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:18,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:18,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:18,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:18,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:18,848 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-02-25 15:52:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:19,389 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-02-25 15:52:19,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:19,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:19,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:19,391 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:52:19,391 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:52:19,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:19,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:52:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-25 15:52:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:52:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-02-25 15:52:19,409 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-02-25 15:52:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:19,409 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-02-25 15:52:19,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-02-25 15:52:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:19,410 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:19,410 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:19,411 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-02-25 15:52:19,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:19,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:19,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:19,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:19,561 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:52:19,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:19,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:19,561 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:19,561 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-02-25 15:52:19,562 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:19,562 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:20,259 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:20,259 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:20,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:20,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:20,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:20,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 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:52:20,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:20,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:20,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:20,274 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:52:20,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:20,280 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 21 treesize of output 24 [2019-02-25 15:52:20,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,289 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 24 treesize of output 30 [2019-02-25 15:52:20,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,297 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 26 treesize of output 40 [2019-02-25 15:52:20,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,309 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:20,314 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,323 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 30 treesize of output 72 [2019-02-25 15:52:20,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,339 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:20,340 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,385 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,407 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,426 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,440 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,453 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,510 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:52:20,510 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,523 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,534 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,547 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,566 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,592 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,636 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:52:20,636 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:20,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,666 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:52:20,667 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,711 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:52:20,711 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:20,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:20,744 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:20,745 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:52:20,746 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:20,846 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:52:20,846 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:52:20,867 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:52:20,867 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:20,890 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:52:20,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:20,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:20,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:20,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:20,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:20,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:20,911 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-02-25 15:52:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:21,690 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-02-25 15:52:21,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:21,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:21,692 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:52:21,692 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:52:21,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:52:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-02-25 15:52:21,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:52:21,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-02-25 15:52:21,707 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-02-25 15:52:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:21,707 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-02-25 15:52:21,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-02-25 15:52:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:21,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:21,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:21,709 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-02-25 15:52:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:21,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:21,815 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:52:21,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:21,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:21,816 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:21,816 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-02-25 15:52:21,817 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:21,817 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:21,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:21,987 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:21,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:21,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:21,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:21,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:21,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:22,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:52:22,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:22,020 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 21 treesize of output 24 [2019-02-25 15:52:22,042 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:52:22,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,052 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:52:22,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,060 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:52:22,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:22,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:52:22,082 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:52:22,083 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,108 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,148 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,165 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,176 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,189 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,232 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:22,233 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,247 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,257 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,274 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:22,308 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:52:22,309 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-02-25 15:52:24,381 WARN L181 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-02-25 15:52:24,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:24,601 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:24,603 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:25,871 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:52:25,871 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-02-25 15:52:27,995 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-02-25 15:52:27,998 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:52:27,998 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:28,001 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:52:28,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:52:28,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:52:28,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:52:28,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:52:28,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:52:28,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:28,021 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-02-25 15:52:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:28,081 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-02-25 15:52:28,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:52:28,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:52:28,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:28,083 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:52:28,083 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:52:28,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:52:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:52:28,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-02-25 15:52:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:52:28,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-02-25 15:52:28,102 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-02-25 15:52:28,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:28,102 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-02-25 15:52:28,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:52:28,103 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-02-25 15:52:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:28,104 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:28,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:28,104 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-02-25 15:52:28,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:28,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:28,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:28,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:28,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:28,185 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:52:28,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:28,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:28,185 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:28,185 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-02-25 15:52:28,186 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:28,186 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:28,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:28,402 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:28,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:28,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:28,403 INFO 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:52:28,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:28,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:28,416 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:28,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:28,488 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:28,488 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,500 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,511 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,526 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,552 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,601 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 21 treesize of output 24 [2019-02-25 15:52:28,603 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 24 treesize of output 30 [2019-02-25 15:52:28,605 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:52:28,608 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:28,612 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 30 treesize of output 72 [2019-02-25 15:52:28,619 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:28,620 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,658 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,677 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,693 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,705 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,717 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,747 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:52:28,747 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:28,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,782 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:28,783 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,809 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:52:28,810 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:28,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:28,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:28,837 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:28,864 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:52:28,864 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:28,882 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:52:28,882 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:28,904 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:52:28,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:28,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:28,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:28,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:28,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:28,924 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-02-25 15:52:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:29,324 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-02-25 15:52:29,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:29,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:52:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:29,327 INFO L225 Difference]: With dead ends: 121 [2019-02-25 15:52:29,327 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:52:29,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:52:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-02-25 15:52:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:52:29,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-25 15:52:29,347 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-25 15:52:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:29,347 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-25 15:52:29,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-25 15:52:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:52:29,348 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:29,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:52:29,349 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:29,349 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-02-25 15:52:29,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:29,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:29,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:29,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:29,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:29,413 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:52:29,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:29,414 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:29,414 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:52:29,414 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-02-25 15:52:29,416 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:29,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:29,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:29,581 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:52:29,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:29,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:29,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:29,581 INFO 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:52:29,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:29,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:29,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:52:29,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:29,604 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 21 treesize of output 24 [2019-02-25 15:52:29,611 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 26 [2019-02-25 15:52:29,619 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,622 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:52:29,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,637 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:52:29,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,653 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:52:29,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:52:29,678 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,705 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,726 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,743 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,754 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,767 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,803 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:52:29,803 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,812 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,822 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,837 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,867 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:52:29,867 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:52:29,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:29,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:52:29,898 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:29,923 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:52:29,924 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-25 15:52:29,939 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:52:29,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:29,947 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:52:29,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:29,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:52:29,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:29,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:52:29,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:52:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:52:29,967 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-02-25 15:52:30,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:30,206 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-02-25 15:52:30,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:52:30,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-25 15:52:30,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:30,208 INFO L225 Difference]: With dead ends: 110 [2019-02-25 15:52:30,208 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:52:30,209 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:52:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:52:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-02-25 15:52:30,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:52:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-25 15:52:30,224 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-25 15:52:30,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:30,224 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-25 15:52:30,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:52:30,225 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-25 15:52:30,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:30,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:30,226 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:52:30,226 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:30,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:30,226 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-02-25 15:52:30,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:30,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:30,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:30,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:30,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:30,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:52:30,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:30,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:30,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:30,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:30,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:30,357 INFO 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:52:30,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:30,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:30,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:30,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:30,374 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:52:30,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:30,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:52:30,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,393 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 24 treesize of output 30 [2019-02-25 15:52:30,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,410 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 26 treesize of output 40 [2019-02-25 15:52:30,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,421 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 28 treesize of output 54 [2019-02-25 15:52:30,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,427 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 30 treesize of output 72 [2019-02-25 15:52:30,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,434 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,437 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:30,438 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,494 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,517 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,536 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,550 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,563 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,624 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:52:30,625 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,639 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,649 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,663 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,712 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,737 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,781 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:52:30,781 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:30,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,846 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:52:30,847 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,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:52:30,910 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:30,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:30,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, 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 91 [2019-02-25 15:52:30,938 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:30,980 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:52:30,981 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-02-25 15:52:31,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:31,008 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:52:31,008 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:31,050 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:52:31,051 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-25 15:52:31,070 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:52:31,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:31,091 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:52:31,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:31,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:31,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:31,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:31,112 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-02-25 15:52:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:31,835 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-02-25 15:52:31,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:31,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:31,838 INFO L225 Difference]: With dead ends: 133 [2019-02-25 15:52:31,838 INFO L226 Difference]: Without dead ends: 128 [2019-02-25 15:52:31,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-02-25 15:52:31,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-02-25 15:52:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:52:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-02-25 15:52:31,855 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-02-25 15:52:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:31,855 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-02-25 15:52:31,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-02-25 15:52:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:31,856 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:31,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:31,857 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:31,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:31,857 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-02-25 15:52:31,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:31,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:31,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:32,195 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:52:32,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:32,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:32,196 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:32,196 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-02-25 15:52:32,197 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:32,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:32,521 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:32,521 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:32,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:32,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:32,522 INFO 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:52:32,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:32,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:32,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:32,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:32,542 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 21 treesize of output 24 [2019-02-25 15:52:32,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,548 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 24 treesize of output 30 [2019-02-25 15:52:32,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,579 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 26 treesize of output 40 [2019-02-25 15:52:32,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,589 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 28 treesize of output 54 [2019-02-25 15:52:32,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,601 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 30 treesize of output 72 [2019-02-25 15:52:32,618 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:32,619 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,653 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,676 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,695 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,711 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,725 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,767 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:32,768 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,778 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,789 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,802 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,820 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,851 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:52:32,851 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:32,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:32,923 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:32,924 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:32,978 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:52:32,978 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:33,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,001 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:33,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:33,008 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:33,033 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:52:33,033 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:33,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:52:33,051 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:33,073 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:52:33,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:33,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:33,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:33,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:33,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:33,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:33,093 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-02-25 15:52:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:33,429 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-02-25 15:52:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:33,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:33,432 INFO L225 Difference]: With dead ends: 125 [2019-02-25 15:52:33,432 INFO L226 Difference]: Without dead ends: 124 [2019-02-25 15:52:33,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-25 15:52:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-02-25 15:52:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-25 15:52:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-02-25 15:52:33,450 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-02-25 15:52:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:33,450 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-02-25 15:52:33,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-02-25 15:52:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:33,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:33,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:33,451 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-02-25 15:52:33,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:33,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:33,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:33,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:33,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:33,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:52:33,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:33,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:33,599 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:33,600 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-02-25 15:52:33,601 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:33,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:34,035 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:34,036 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:34,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:34,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:34,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:34,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 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:52:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:34,045 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:34,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:52:34,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:34,096 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:52:34,097 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,124 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,134 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,151 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,171 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,202 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,237 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 21 treesize of output 24 [2019-02-25 15:52:34,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:52:34,243 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 26 treesize of output 40 [2019-02-25 15:52:34,245 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:34,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:52:34,252 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:34,253 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,289 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,310 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,326 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,339 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,350 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,397 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:52:34,397 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:34,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,434 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:52:34,434 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,483 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:52:34,483 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:34,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,537 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,547 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:52:34,548 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,612 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:52:34,612 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:52:34,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:34,666 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:34,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:52:34,667 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:34,738 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:52:34,739 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:52:34,770 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:52:34,770 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:34,835 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:52:34,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:34,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:34,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:34,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:34,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:34,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:34,856 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-02-25 15:52:36,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:36,200 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-02-25 15:52:36,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:36,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:36,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:36,203 INFO L225 Difference]: With dead ends: 149 [2019-02-25 15:52:36,203 INFO L226 Difference]: Without dead ends: 145 [2019-02-25 15:52:36,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:52:36,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-25 15:52:36,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-02-25 15:52:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:52:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-02-25 15:52:36,223 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-02-25 15:52:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:36,223 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-02-25 15:52:36,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-02-25 15:52:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:36,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:36,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:36,224 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-02-25 15:52:36,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:36,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:36,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:36,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:36,316 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:52:36,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:36,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:36,316 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:36,316 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-02-25 15:52:36,317 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:36,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:36,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:36,658 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:36,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:36,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:36,659 INFO 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:52:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:36,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:36,674 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:36,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:36,677 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 21 treesize of output 24 [2019-02-25 15:52:36,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,687 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 24 treesize of output 30 [2019-02-25 15:52:36,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,694 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 26 treesize of output 40 [2019-02-25 15:52:36,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,706 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 28 treesize of output 54 [2019-02-25 15:52:36,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:36,722 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 30 treesize of output 72 [2019-02-25 15:52:36,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:36,739 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,794 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,816 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,833 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,848 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,862 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,912 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:36,912 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,922 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,932 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,943 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,961 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:36,993 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:52:36,994 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:37,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,046 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:37,047 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,073 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:52:37,073 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:37,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,105 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:37,106 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,134 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:52:37,134 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:37,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,158 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:37,163 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:37,163 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:37,164 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:37,190 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:52:37,190 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:52:37,209 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:52:37,209 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:37,252 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:52:37,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:37,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:37,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:37,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:37,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:37,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:37,273 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-02-25 15:52:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:37,799 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-02-25 15:52:37,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:37,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:37,802 INFO L225 Difference]: With dead ends: 138 [2019-02-25 15:52:37,802 INFO L226 Difference]: Without dead ends: 136 [2019-02-25 15:52:37,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:37,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-25 15:52:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-02-25 15:52:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:52:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-02-25 15:52:37,823 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-02-25 15:52:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:37,823 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-02-25 15:52:37,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-02-25 15:52:37,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:37,824 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:37,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:37,825 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:37,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-02-25 15:52:37,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:37,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:37,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:37,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:37,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:38,215 WARN L181 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-02-25 15:52:38,411 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:52:38,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:38,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:38,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:38,412 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-02-25 15:52:38,414 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:38,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:38,767 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:38,768 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:38,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:38,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:38,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:38,768 INFO 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:52:38,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:38,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:38,782 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:52:38,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:38,832 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:52:38,833 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,856 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,867 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,885 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,904 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,934 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:38,972 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 21 treesize of output 24 [2019-02-25 15:52:38,975 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 24 treesize of output 30 [2019-02-25 15:52:38,978 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 26 treesize of output 40 [2019-02-25 15:52:38,981 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 28 treesize of output 54 [2019-02-25 15:52:38,984 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 30 treesize of output 72 [2019-02-25 15:52:38,988 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:38,989 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,025 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,050 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,067 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,081 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,094 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,157 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:52:39,158 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:39,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,181 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:52:39,182 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,224 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:52:39,224 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:39,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,264 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:39,265 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:52:39,266 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,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:52:39,308 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:52:39,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:39,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, 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:52:39,343 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:39,386 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:52:39,386 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-25 15:52:39,405 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:52:39,405 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:39,433 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:52:39,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:39,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:39,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:39,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:39,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:39,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:39,453 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-02-25 15:52:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:40,103 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-02-25 15:52:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:40,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:40,107 INFO L225 Difference]: With dead ends: 152 [2019-02-25 15:52:40,107 INFO L226 Difference]: Without dead ends: 151 [2019-02-25 15:52:40,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:40,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-25 15:52:40,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-02-25 15:52:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-25 15:52:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-02-25 15:52:40,126 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-02-25 15:52:40,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:40,126 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-02-25 15:52:40,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:40,126 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-02-25 15:52:40,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:40,127 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:40,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:40,127 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:40,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-02-25 15:52:40,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:40,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:40,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:40,322 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-02-25 15:52:40,364 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:52:40,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:40,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:40,365 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:40,365 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-02-25 15:52:40,366 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:40,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:40,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:40,658 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:40,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:40,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:40,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:40,659 INFO 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:52:40,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:40,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:40,678 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:52:40,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:40,743 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:52:40,743 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,761 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,848 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,861 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,886 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,921 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:40,958 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 21 treesize of output 24 [2019-02-25 15:52:40,961 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 24 treesize of output 30 [2019-02-25 15:52:40,965 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 26 treesize of output 40 [2019-02-25 15:52:40,967 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 28 treesize of output 54 [2019-02-25 15:52:40,970 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 30 treesize of output 72 [2019-02-25 15:52:40,974 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:40,974 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,010 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,030 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,045 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,058 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,070 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,117 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:52:41,117 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:41,159 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,160 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:52:41,160 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,202 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:52:41,202 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:41,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,238 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:41,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 43 treesize of output 93 [2019-02-25 15:52:41,239 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,285 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:52:41,286 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:52:41,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:41,340 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:41,341 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:52:41,342 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:41,383 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:52:41,384 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:59 [2019-02-25 15:52:41,406 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:52:41,407 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:41,446 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:52:41,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:41,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:41,465 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:41,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:41,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:41,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:41,466 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-02-25 15:52:42,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:42,194 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-02-25 15:52:42,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:42,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:42,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:42,197 INFO L225 Difference]: With dead ends: 141 [2019-02-25 15:52:42,197 INFO L226 Difference]: Without dead ends: 140 [2019-02-25 15:52:42,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-25 15:52:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-02-25 15:52:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:52:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-02-25 15:52:42,216 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-02-25 15:52:42,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:42,216 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-02-25 15:52:42,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:42,216 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-02-25 15:52:42,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:42,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:42,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:42,217 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:42,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:42,218 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-02-25 15:52:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:42,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,326 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:52:42,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:42,326 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:42,327 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-02-25 15:52:42,330 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:42,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:42,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:42,640 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:42,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:42,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:42,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:42,640 INFO 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:52:42,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:42,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:42,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:42,672 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:42,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:42,689 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 21 treesize of output 24 [2019-02-25 15:52:42,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,695 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 24 treesize of output 30 [2019-02-25 15:52:42,698 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,701 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 26 treesize of output 40 [2019-02-25 15:52:42,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,710 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 28 treesize of output 54 [2019-02-25 15:52:42,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:42,728 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:52:42,845 INFO L292 Elim1Store]: Index analysis took 114 ms [2019-02-25 15:52:42,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:42,846 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,874 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,898 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,915 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,931 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,943 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:42,989 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:42,990 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,000 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,008 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,025 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,059 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,092 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:52:43,092 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:43,132 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,133 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:43,133 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,159 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:52:43,160 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:43,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,186 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:43,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:43,188 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,214 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:52:43,214 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-25 15:52:43,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,240 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:43,241 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:52:43,242 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:43,269 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:52:43,269 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:52:43,285 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:52:43,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:43,310 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:52:43,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:43,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:52:43,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:43,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:43,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:43,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:52:43,330 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-02-25 15:52:43,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:43,977 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-02-25 15:52:43,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:52:43,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:43,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:43,979 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:52:43,980 INFO L226 Difference]: Without dead ends: 162 [2019-02-25 15:52:43,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:43,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-25 15:52:43,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-02-25 15:52:43,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-25 15:52:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-02-25 15:52:43,999 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-02-25 15:52:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:43,999 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-02-25 15:52:43,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:43,999 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-02-25 15:52:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:44,000 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:44,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:44,000 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:44,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:44,001 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-02-25 15:52:44,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:44,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:44,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:44,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:44,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:44,086 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:52:44,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:44,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:44,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:44,087 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-02-25 15:52:44,089 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:44,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:44,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:44,410 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:44,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:44,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:44,411 INFO 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:52:44,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:44,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:44,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:52:44,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:44,469 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:52:44,470 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,499 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,514 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,530 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,553 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,619 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:52:44,659 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 24 treesize of output 30 [2019-02-25 15:52:44,661 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 26 treesize of output 40 [2019-02-25 15:52:44,664 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:44,668 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 30 treesize of output 72 [2019-02-25 15:52:44,671 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:44,672 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,710 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,741 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,763 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,784 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,800 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,859 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:52:44,860 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:44,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:44,904 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:52:44,904 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:44,964 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:52:44,964 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:45,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,022 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:52:45,023 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,082 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:52:45,082 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:52:45,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,118 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,120 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,121 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:45,123 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:45,124 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:52:45,124 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:45,166 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:52:45,166 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:52:45,188 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:52:45,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:45,224 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:52:45,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:45,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:45,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:45,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:45,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:45,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:45,245 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-02-25 15:52:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:45,917 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-02-25 15:52:45,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:45,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:45,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:45,920 INFO L225 Difference]: With dead ends: 163 [2019-02-25 15:52:45,920 INFO L226 Difference]: Without dead ends: 160 [2019-02-25 15:52:45,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:45,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-25 15:52:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-02-25 15:52:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-25 15:52:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-02-25 15:52:45,946 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-02-25 15:52:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:45,947 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-02-25 15:52:45,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-02-25 15:52:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:45,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:45,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:45,948 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-02-25 15:52:45,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:45,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:45,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:45,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:45,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:46,050 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:52:46,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:46,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:46,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:46,050 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-02-25 15:52:46,052 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:46,052 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:46,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:46,344 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:46,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:46,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:46,344 INFO 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:52:46,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:46,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:46,358 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:46,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:46,391 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:46,391 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,415 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,431 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,446 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,465 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,490 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 21 treesize of output 24 [2019-02-25 15:52:46,494 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 24 treesize of output 30 [2019-02-25 15:52:46,497 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:52:46,499 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:46,503 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 30 treesize of output 72 [2019-02-25 15:52:46,509 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:46,510 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,535 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,553 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,569 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,582 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,594 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,628 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:52:46,628 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:46,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,680 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:46,680 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,708 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:52:46,708 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:46,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,739 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:46,740 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,768 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:52:46,768 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:52:46,835 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:46,841 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:46,842 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:52:46,842 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:46,870 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:52:46,871 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:52:46,891 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:52:46,892 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:46,932 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:52:46,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:46,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:52:46,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:46,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:46,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:46,952 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-02-25 15:52:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:47,482 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-02-25 15:52:47,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:47,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:47,485 INFO L225 Difference]: With dead ends: 165 [2019-02-25 15:52:47,485 INFO L226 Difference]: Without dead ends: 163 [2019-02-25 15:52:47,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:52:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-25 15:52:47,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-02-25 15:52:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-25 15:52:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-02-25 15:52:47,512 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-02-25 15:52:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:47,513 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-02-25 15:52:47,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:47,513 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-02-25 15:52:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:47,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:47,514 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:47,514 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-02-25 15:52:47,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:47,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:47,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:47,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:47,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:47,562 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:52:47,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:47,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:47,563 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:47,563 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-02-25 15:52:47,564 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:47,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:47,785 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:47,785 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:47,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:47,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:47,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:47,786 INFO 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:52:47,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:47,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:47,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:47,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:47,803 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 21 treesize of output 24 [2019-02-25 15:52:47,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,808 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 24 treesize of output 30 [2019-02-25 15:52:47,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,817 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 26 treesize of output 40 [2019-02-25 15:52:47,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,825 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,828 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 28 treesize of output 54 [2019-02-25 15:52:47,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,838 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:47,843 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 30 treesize of output 72 [2019-02-25 15:52:47,860 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:47,861 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,891 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,913 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,931 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,945 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:47,958 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:48,001 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,010 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,021 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,037 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,054 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,086 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:52:48,087 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:48,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,128 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:48,128 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,156 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:52:48,156 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:52:48,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:48,177 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:48,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:52:48,179 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,207 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:52:48,207 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-25 15:52:48,236 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:52:48,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:48,255 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:52:48,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:48,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:52:48,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:48,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:52:48,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:52:48,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:52:48,276 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-02-25 15:52:48,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:48,581 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-02-25 15:52:48,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:52:48,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-25 15:52:48,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:48,584 INFO L225 Difference]: With dead ends: 158 [2019-02-25 15:52:48,584 INFO L226 Difference]: Without dead ends: 156 [2019-02-25 15:52:48,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-25 15:52:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-02-25 15:52:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-25 15:52:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-02-25 15:52:48,607 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-02-25 15:52:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:48,607 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-02-25 15:52:48,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:52:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-02-25 15:52:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:48,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:48,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:48,609 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:48,609 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-02-25 15:52:48,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:48,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:48,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:48,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:48,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:52:48,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:48,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:48,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:52:48,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:52:48,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:48,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:48,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:52:48,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:52:48,852 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:52:48,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:52:48,853 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:52:48,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:48,881 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:52:48,882 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,915 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,926 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,940 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,962 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:48,992 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,029 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 21 treesize of output 24 [2019-02-25 15:52:49,033 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 24 treesize of output 30 [2019-02-25 15:52:49,036 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 26 treesize of output 40 [2019-02-25 15:52:49,039 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 28 treesize of output 54 [2019-02-25 15:52:49,043 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:52:49,049 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:52:49,049 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,084 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,105 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,119 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,133 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,145 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,192 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:52:49,193 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:52:49,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,223 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:52:49,223 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,267 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:52:49,268 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:52:49,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,306 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,310 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,312 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:52:49,313 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,357 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:52:49,357 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:52:49,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:49,391 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:49,392 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:52:49,393 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:49,433 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:52:49,434 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:52:49,456 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:52:49,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:49,479 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:52:49,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:49,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-25 15:52:49,499 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:49,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:52:49,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:52:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:52:49,500 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-02-25 15:52:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:50,271 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-02-25 15:52:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:52:50,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:52:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:50,275 INFO L225 Difference]: With dead ends: 241 [2019-02-25 15:52:50,275 INFO L226 Difference]: Without dead ends: 235 [2019-02-25 15:52:50,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:52:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-25 15:52:50,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-02-25 15:52:50,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-25 15:52:50,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-02-25 15:52:50,314 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-02-25 15:52:50,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:50,314 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-02-25 15:52:50,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:52:50,314 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-02-25 15:52:50,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:50,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:50,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:50,315 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-02-25 15:52:50,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:50,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:50,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:52:50,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:50,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:50,674 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:52:50,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:50,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:50,675 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:50,675 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-02-25 15:52:50,677 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:50,677 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:50,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:50,945 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:52:50,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:50,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:50,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:50,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:50,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:50,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:50,974 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:52:50,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:50,992 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 21 treesize of output 24 [2019-02-25 15:52:51,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,022 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 24 treesize of output 30 [2019-02-25 15:52:51,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,027 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,028 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 26 treesize of output 40 [2019-02-25 15:52:51,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:51,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,045 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 30 treesize of output 72 [2019-02-25 15:52:51,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:51,055 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,085 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,125 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,144 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,159 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,172 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,216 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:51,216 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,225 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,237 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,253 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,271 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:51,305 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:52:51,305 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:52:51,551 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-25 15:52:51,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,569 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:52:51,570 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:52:51,675 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:52:51,675 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-02-25 15:52:51,908 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-02-25 15:52:51,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,961 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:51,973 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:52:51,974 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-02-25 15:52:51,974 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:52,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:52:52,085 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 8 case distinctions, treesize of input 65 treesize of output 95 [2019-02-25 15:52:52,090 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-25 15:52:52,373 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:52:52,373 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-02-25 15:52:56,903 WARN L181 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-02-25 15:52:56,909 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:52:56,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:52:57,036 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:52:57,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:52:57,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:52:57,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:52:57,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:52:57,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:52:57,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:52:57,056 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-02-25 15:52:57,526 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-25 15:52:58,010 WARN L181 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-02-25 15:52:58,662 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-02-25 15:52:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:52:58,968 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-02-25 15:52:58,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:52:58,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:52:58,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:52:58,971 INFO L225 Difference]: With dead ends: 208 [2019-02-25 15:52:58,971 INFO L226 Difference]: Without dead ends: 207 [2019-02-25 15:52:58,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:52:58,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-25 15:52:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-02-25 15:52:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:52:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-02-25 15:52:59,007 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-02-25 15:52:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:52:59,007 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-02-25 15:52:59,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:52:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-02-25 15:52:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:52:59,008 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:52:59,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:52:59,009 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:52:59,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-02-25 15:52:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:52:59,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:59,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:52:59,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:52:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:59,166 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:52:59,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:59,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:52:59,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:52:59,167 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-02-25 15:52:59,169 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:52:59,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:52:59,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:52:59,613 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:52:59,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:52:59,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:52:59,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:52:59,614 INFO 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:52:59,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:52:59,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:52:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:52:59,629 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:52:59,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:52:59,664 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:52:59,665 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,692 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,701 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,717 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,736 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,761 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 21 treesize of output 24 [2019-02-25 15:52:59,765 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 24 treesize of output 30 [2019-02-25 15:52:59,768 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:52:59,770 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:52:59,773 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 30 treesize of output 72 [2019-02-25 15:52:59,781 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:52:59,782 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,810 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,831 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,847 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,860 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,873 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:52:59,906 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:52:59,907 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:53:00,153 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-25 15:53:00,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,184 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:53:00,185 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:00,334 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-02-25 15:53:00,334 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-25 15:53:00,614 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-25 15:53:00,620 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,626 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,639 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 2 case distinctions, treesize of input 65 treesize of output 83 [2019-02-25 15:53:00,640 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:00,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:00,800 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-02-25 15:53:00,801 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:00,882 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-25 15:53:00,883 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-02-25 15:53:01,109 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-02-25 15:53:01,136 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,144 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,146 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,147 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,149 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,150 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:01,174 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 6 case distinctions, treesize of input 55 treesize of output 93 [2019-02-25 15:53:01,177 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:53:01,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,448 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:01,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:53:01,449 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:01,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:01,640 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 78 [2019-02-25 15:53:01,641 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:01,799 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:53:01,800 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:250 [2019-02-25 15:53:01,923 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:53:01,923 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:01,960 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:53:01,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:01,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:53:01,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:01,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:01,981 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-02-25 15:53:02,666 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-02-25 15:53:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:03,242 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-02-25 15:53:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:53:03,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:03,246 INFO L225 Difference]: With dead ends: 280 [2019-02-25 15:53:03,247 INFO L226 Difference]: Without dead ends: 279 [2019-02-25 15:53:03,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:53:03,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-25 15:53:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-02-25 15:53:03,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-25 15:53:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-02-25 15:53:03,290 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-02-25 15:53:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:03,290 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-02-25 15:53:03,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-02-25 15:53:03,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:03,292 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:03,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:03,292 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-02-25 15:53:03,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:03,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:03,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:03,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:03,351 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:53:03,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:53:03,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:53:03,352 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:53:03,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:53:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:53:03,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:53:03,353 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-02-25 15:53:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:03,460 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-02-25 15:53:03,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:53:03,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:53:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:03,464 INFO L225 Difference]: With dead ends: 201 [2019-02-25 15:53:03,464 INFO L226 Difference]: Without dead ends: 198 [2019-02-25 15:53:03,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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:53:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-25 15:53:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-02-25 15:53:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-25 15:53:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-02-25 15:53:03,511 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-02-25 15:53:03,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:03,511 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-02-25 15:53:03,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:53:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-02-25 15:53:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:03,512 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:03,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:03,513 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:03,513 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-02-25 15:53:03,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:03,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:03,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:03,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:03,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:03,809 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:53:03,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:03,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:03,810 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:03,810 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-02-25 15:53:03,810 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:03,811 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:04,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:04,132 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:04,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:04,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:04,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:04,133 INFO 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:53:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:04,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:04,147 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:53:04,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:04,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:04,190 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,206 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,224 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,247 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,273 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,305 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 21 treesize of output 24 [2019-02-25 15:53:04,309 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 24 treesize of output 30 [2019-02-25 15:53:04,312 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:53:04,315 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:53:04,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:53:04,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:53:04,327 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,353 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,372 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,387 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,400 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,412 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,446 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:53:04,446 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:53:04,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,484 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:04,484 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,512 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:53:04,512 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:53:04,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:04,536 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:04,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:04,537 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:04,563 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:53:04,564 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-25 15:53:04,585 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:53:04,585 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:04,607 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:53:04,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:04,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:04,627 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:04,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:04,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:04,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:04,628 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-02-25 15:53:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:04,953 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-02-25 15:53:04,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:04,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:04,956 INFO L225 Difference]: With dead ends: 208 [2019-02-25 15:53:04,956 INFO L226 Difference]: Without dead ends: 207 [2019-02-25 15:53:04,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-25 15:53:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-02-25 15:53:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-25 15:53:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-02-25 15:53:05,003 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-02-25 15:53:05,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:05,003 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-02-25 15:53:05,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-02-25 15:53:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:05,004 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:05,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:05,005 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-02-25 15:53:05,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:05,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:05,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:05,130 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:53:05,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:05,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:05,131 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:05,131 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-02-25 15:53:05,132 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:05,132 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:05,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:05,384 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:05,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:05,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:05,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:05,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:05,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:05,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:53:05,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:05,433 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:05,434 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,453 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,474 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,500 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,533 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:53:05,538 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:53:05,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:05,549 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:05,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:05,580 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:53:05,581 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,614 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,633 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,648 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,661 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,671 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,702 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:53:05,703 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:53:05,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,744 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:05,745 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,769 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:53:05,769 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:53:05,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:05,795 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:05,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:05,822 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:53:05,823 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-25 15:53:05,841 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:53:05,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:05,862 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:53:05,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:05,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:05,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:05,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:05,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:05,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:05,884 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-02-25 15:53:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:06,188 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-02-25 15:53:06,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:06,189 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:06,192 INFO L225 Difference]: With dead ends: 210 [2019-02-25 15:53:06,192 INFO L226 Difference]: Without dead ends: 208 [2019-02-25 15:53:06,193 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:53:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-25 15:53:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-02-25 15:53:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-25 15:53:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-02-25 15:53:06,224 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-02-25 15:53:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:06,224 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-02-25 15:53:06,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-02-25 15:53:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:06,225 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:06,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:06,225 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:06,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-02-25 15:53:06,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:06,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:06,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:06,360 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:53:06,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:06,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:06,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:06,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:06,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:06,361 INFO 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:53:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:06,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:06,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:53:06,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:06,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:53:06,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:06,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:53:06,427 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,444 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,453 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,468 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,495 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,531 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,576 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 21 treesize of output 24 [2019-02-25 15:53:06,578 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 24 treesize of output 30 [2019-02-25 15:53:06,582 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 26 treesize of output 40 [2019-02-25 15:53:06,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:53:06,588 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:53:06,592 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:53:06,593 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,652 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,671 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,687 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,700 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,712 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,758 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:53:06,759 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:53:06,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,795 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:53:06,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,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:53:06,841 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:06,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,874 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,877 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:53:06,877 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:06,920 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:53:06,921 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:53:06,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,977 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:06,985 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:06,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:53:06,986 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:07,028 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:53:07,028 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:07,053 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:53:07,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:07,090 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:53:07,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:07,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:07,109 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:07,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:07,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:07,110 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-02-25 15:53:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:08,769 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-02-25 15:53:08,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:08,770 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:08,773 INFO L225 Difference]: With dead ends: 242 [2019-02-25 15:53:08,773 INFO L226 Difference]: Without dead ends: 240 [2019-02-25 15:53:08,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:53:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-25 15:53:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-02-25 15:53:08,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-25 15:53:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-02-25 15:53:08,819 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-02-25 15:53:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:08,820 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-02-25 15:53:08,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-02-25 15:53:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:08,821 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:08,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:08,821 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-02-25 15:53:08,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:08,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:08,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:08,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:08,980 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:53:09,373 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:53:09,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:09,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:09,373 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:09,374 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-02-25 15:53:09,374 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:09,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:09,681 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:09,681 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:09,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:09,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:09,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:09,681 INFO 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:53:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:09,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:09,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:53:09,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:09,703 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 21 treesize of output 24 [2019-02-25 15:53:09,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,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 24 treesize of output 30 [2019-02-25 15:53:09,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,719 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 26 treesize of output 40 [2019-02-25 15:53:09,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,731 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 28 treesize of output 54 [2019-02-25 15:53:09,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,744 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 30 treesize of output 72 [2019-02-25 15:53:09,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,756 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:09,764 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:53:09,765 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,812 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,836 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,856 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,872 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,886 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,940 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:53:09,941 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,956 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,967 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:09,988 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,015 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,045 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,093 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:53:10,093 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:53:10,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,129 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:53:10,130 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,172 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:53:10,173 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:10,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,203 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,208 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,209 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:53:10,210 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,254 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:53:10,254 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-25 15:53:10,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:10,301 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:10,301 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:53:10,302 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:10,364 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:53:10,365 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:53:10,387 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:10,466 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:53:10,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:10,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:10,484 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:10,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:10,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:10,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:10,485 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-02-25 15:53:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:11,222 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-02-25 15:53:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:11,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:11,226 INFO L225 Difference]: With dead ends: 249 [2019-02-25 15:53:11,226 INFO L226 Difference]: Without dead ends: 247 [2019-02-25 15:53:11,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:53:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-25 15:53:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-02-25 15:53:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-25 15:53:11,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-02-25 15:53:11,259 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-02-25 15:53:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:11,259 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-02-25 15:53:11,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:11,259 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-02-25 15:53:11,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:11,260 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:11,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:11,260 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:11,261 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-02-25 15:53:11,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:11,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:11,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:11,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:11,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:11,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:53:11,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:11,422 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:11,422 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:11,422 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-02-25 15:53:11,423 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:11,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:11,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:11,705 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:11,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:11,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:11,706 INFO 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:53:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:11,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:11,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:11,721 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:53:11,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:11,726 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 21 treesize of output 24 [2019-02-25 15:53:11,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,732 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 24 treesize of output 30 [2019-02-25 15:53:11,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:53:11,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,749 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 28 treesize of output 54 [2019-02-25 15:53:11,752 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,755 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:11,761 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 30 treesize of output 72 [2019-02-25 15:53:11,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:53:11,778 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,813 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,835 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,854 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,869 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,883 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,927 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:11,928 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,938 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,950 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,966 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:11,985 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,018 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:12,019 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:53:12,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:12,077 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,105 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:53:12,106 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:53:12,135 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,137 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,138 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,139 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,140 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,142 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:12,143 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,171 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:53:12,172 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 15:53:12,197 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,199 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,200 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,201 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,202 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,204 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,205 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:12,207 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:12,207 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:12,208 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:12,236 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:53:12,236 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:53:12,256 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:53:12,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:12,295 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:53:12,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:12,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:12,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:12,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:12,316 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-02-25 15:53:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:12,880 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-02-25 15:53:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:12,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:12,884 INFO L225 Difference]: With dead ends: 260 [2019-02-25 15:53:12,884 INFO L226 Difference]: Without dead ends: 258 [2019-02-25 15:53:12,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:53:12,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-25 15:53:12,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-02-25 15:53:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:53:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-25 15:53:12,921 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-25 15:53:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:12,921 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-25 15:53:12,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-25 15:53:12,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:12,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:12,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:12,922 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:12,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:12,922 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-02-25 15:53:12,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:12,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:12,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:12,990 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:53:12,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:12,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:12,991 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:12,991 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-02-25 15:53:12,992 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:12,992 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:13,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:13,224 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:13,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:13,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:13,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:13,224 INFO 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:53:13,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:13,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:13,239 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:53:13,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:13,243 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 21 treesize of output 24 [2019-02-25 15:53:13,248 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:53:13,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,256 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:13,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,269 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:13,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,283 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,283 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:13,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:53:13,301 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,345 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,365 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,382 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,397 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,411 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,461 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:53:13,462 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,475 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,486 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,507 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,533 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,578 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:53:13,578 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:53:13,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,607 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 41 treesize of output 87 [2019-02-25 15:53:13,608 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,650 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:53:13,650 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:53:13,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:13,680 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:13,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:53:13,682 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:13,723 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:53:13,723 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-02-25 15:53:13,741 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:53:13,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:13,762 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:53:13,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:13,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:13,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:13,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:13,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:13,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:13,782 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-25 15:53:14,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:14,116 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-02-25 15:53:14,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:14,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:14,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:14,119 INFO L225 Difference]: With dead ends: 244 [2019-02-25 15:53:14,120 INFO L226 Difference]: Without dead ends: 243 [2019-02-25 15:53:14,120 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:53:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-25 15:53:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-02-25 15:53:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-25 15:53:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-25 15:53:14,167 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-25 15:53:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:14,167 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-25 15:53:14,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-25 15:53:14,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:14,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:14,168 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:14,169 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:14,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:14,169 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-02-25 15:53:14,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:14,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:14,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:14,332 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:53:14,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:14,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:14,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:14,333 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-02-25 15:53:14,334 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:14,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:14,549 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:14,550 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:14,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:14,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:14,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:14,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:14,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:14,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:53:14,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:14,568 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:53:14,572 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:53:14,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,584 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:14,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,595 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:14,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:14,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:14,630 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:53:14,630 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,662 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,683 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,700 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,714 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,727 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,766 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:14,767 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,776 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,790 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,805 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:14,837 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:53:14,837 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:53:15,022 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-25 15:53:15,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,073 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:53:15,080 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-25 15:53:15,454 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-02-25 15:53:15,455 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:433 [2019-02-25 15:53:15,619 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 92 [2019-02-25 15:53:15,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,633 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2019-02-25 15:53:15,634 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:15,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,753 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:15,753 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 66 [2019-02-25 15:53:15,754 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:15,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,834 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:15,835 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 47 [2019-02-25 15:53:15,836 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:15,901 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-25 15:53:15,901 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:198, output treesize:126 [2019-02-25 15:53:16,007 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:53:16,007 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:16,049 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:53:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:16,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:16,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:16,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:16,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:16,070 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-25 15:53:16,464 WARN L181 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-25 15:53:18,968 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2019-02-25 15:53:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:31,484 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-02-25 15:53:31,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:53:31,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:31,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:31,488 INFO L225 Difference]: With dead ends: 273 [2019-02-25 15:53:31,488 INFO L226 Difference]: Without dead ends: 272 [2019-02-25 15:53:31,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=79, Invalid=129, Unknown=2, NotChecked=0, Total=210 [2019-02-25 15:53:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-25 15:53:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-02-25 15:53:31,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-02-25 15:53:31,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-02-25 15:53:31,524 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-02-25 15:53:31,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:31,524 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-02-25 15:53:31,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-02-25 15:53:31,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:31,525 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:31,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:31,525 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:31,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-02-25 15:53:31,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:31,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:31,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:31,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:31,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:31,597 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:53:31,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:31,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:31,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:31,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:31,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:31,598 INFO 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:53:31,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:53:31,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:53:31,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:53:31,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:31,615 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:53:31,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:31,618 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 21 treesize of output 24 [2019-02-25 15:53:31,624 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,624 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 24 treesize of output 30 [2019-02-25 15:53:31,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,630 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 26 treesize of output 40 [2019-02-25 15:53:31,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,641 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,641 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 28 treesize of output 54 [2019-02-25 15:53:31,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,664 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 30 treesize of output 72 [2019-02-25 15:53:31,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:31,673 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:53:31,674 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,717 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,755 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,775 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,791 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,806 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,865 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:53:31,865 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,882 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,892 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,911 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,939 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:31,969 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:32,017 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:53:32,017 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:53:32,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,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, 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:53:32,049 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:32,095 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:53:32,095 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:32,123 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,124 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,129 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,130 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:32,131 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:53:32,132 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:32,177 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:53:32,178 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-02-25 15:53:32,219 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,220 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,229 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,230 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:32,231 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:53:32,231 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:32,275 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:53:32,276 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-25 15:53:32,295 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:53:32,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:32,322 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:53:32,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:32,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:53:32,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:32,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:32,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:32,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:53:32,343 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-02-25 15:53:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:33,141 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-02-25 15:53:33,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:33,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:33,146 INFO L225 Difference]: With dead ends: 274 [2019-02-25 15:53:33,146 INFO L226 Difference]: Without dead ends: 273 [2019-02-25 15:53:33,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:53:33,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-02-25 15:53:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-02-25 15:53:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:53:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-25 15:53:33,186 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-25 15:53:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:33,187 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-25 15:53:33,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-25 15:53:33,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:33,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:33,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:33,188 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:33,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:33,188 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-02-25 15:53:33,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:33,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:33,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:33,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:33,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:33,279 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:53:33,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:33,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:33,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:33,280 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-02-25 15:53:33,281 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:33,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:34,626 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:34,627 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:34,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:34,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:34,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:34,627 INFO 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:53:34,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:34,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:34,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:34,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:34,696 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:53:34,697 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,716 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,730 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,750 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,778 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,814 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 21 treesize of output 24 [2019-02-25 15:53:34,819 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:53:34,823 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:34,828 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:34,833 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:34,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:53:34,838 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,872 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,892 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,905 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,918 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,931 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:34,975 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:53:34,975 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-25 15:53:34,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:34,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 41 treesize of output 87 [2019-02-25 15:53:34,998 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:35,039 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:53:35,039 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-02-25 15:53:35,057 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:53:35,057 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:35,068 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:53:35,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:35,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:53:35,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:35,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:53:35,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:53:35,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:53:35,087 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-02-25 15:53:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:35,305 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-02-25 15:53:35,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:53:35,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-25 15:53:35,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:35,309 INFO L225 Difference]: With dead ends: 242 [2019-02-25 15:53:35,309 INFO L226 Difference]: Without dead ends: 241 [2019-02-25 15:53:35,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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:53:35,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-02-25 15:53:35,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-02-25 15:53:35,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-25 15:53:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-25 15:53:35,347 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-25 15:53:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:35,348 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-25 15:53:35,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:53:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-25 15:53:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:35,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:35,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:35,349 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:35,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-02-25 15:53:35,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:35,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:35,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:35,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:35,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:35,505 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-02-25 15:53:35,540 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:53:35,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:35,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:35,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:35,540 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-02-25 15:53:35,541 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:35,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:36,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:36,208 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:36,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:36,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:36,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 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:53:36,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:36,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:36,223 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:53:36,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:36,276 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:53:36,277 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,299 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,310 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,330 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,358 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,390 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,426 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 21 treesize of output 24 [2019-02-25 15:53:36,429 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 24 treesize of output 30 [2019-02-25 15:53:36,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:53:36,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 28 treesize of output 54 [2019-02-25 15:53:36,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 30 treesize of output 72 [2019-02-25 15:53:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:53:36,443 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,480 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,500 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,517 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,531 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,543 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,590 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:53:36,591 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:53:36,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,629 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:53:36,629 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,674 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-25 15:53:36,674 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:36,702 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,703 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,704 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,706 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,709 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:53:36,710 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,754 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:53:36,754 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:36,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,789 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,790 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:36,791 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:36,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, 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:53:36,793 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:36,837 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:53:36,838 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:36,859 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:53:36,859 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:36,900 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:53:36,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:36,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:36,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:36,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:36,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:36,920 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-02-25 15:53:37,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:37,629 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-02-25 15:53:37,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:37,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-25 15:53:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:37,634 INFO L225 Difference]: With dead ends: 276 [2019-02-25 15:53:37,634 INFO L226 Difference]: Without dead ends: 274 [2019-02-25 15:53:37,634 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:53:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-25 15:53:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-02-25 15:53:37,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-25 15:53:37,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-02-25 15:53:37,671 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-02-25 15:53:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:37,672 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-02-25 15:53:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-02-25 15:53:37,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:37,672 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:37,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:37,673 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:37,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-02-25 15:53:37,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:37,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:37,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:37,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:37,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:37,735 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:53:37,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:37,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:37,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:37,736 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-02-25 15:53:37,737 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:37,737 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:37,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:37,948 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:37,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:37,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:37,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:37,949 INFO 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:53:37,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:37,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:37,963 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:53:37,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:38,002 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:38,002 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,021 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,031 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,044 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,064 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,089 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 21 treesize of output 24 [2019-02-25 15:53:38,093 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 24 treesize of output 30 [2019-02-25 15:53:38,096 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:53:38,099 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:53:38,102 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 30 treesize of output 72 [2019-02-25 15:53:38,112 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:53:38,112 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,139 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,159 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,175 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,189 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,201 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,235 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:53:38,235 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:53:38,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,273 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:38,274 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,306 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:53:38,307 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:53:38,364 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:38,490 INFO L292 Elim1Store]: Index analysis took 163 ms [2019-02-25 15:53:38,490 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:38,491 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:38,872 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:53:38,873 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-25 15:53:38,895 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:53:38,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:38,931 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:53:38,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:38,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:53:38,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:38,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:38,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:38,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:38,951 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-02-25 15:53:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:39,363 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-02-25 15:53:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:39,364 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:39,367 INFO L225 Difference]: With dead ends: 288 [2019-02-25 15:53:39,368 INFO L226 Difference]: Without dead ends: 287 [2019-02-25 15:53:39,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:53:39,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-25 15:53:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-02-25 15:53:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-02-25 15:53:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-02-25 15:53:39,419 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-02-25 15:53:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:39,419 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-02-25 15:53:39,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:39,419 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-02-25 15:53:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:53:39,420 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:39,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:53:39,420 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:39,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:39,421 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-02-25 15:53:39,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:39,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:39,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:39,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:39,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:39,495 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:53:39,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:39,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:39,496 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:53:39,496 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-02-25 15:53:39,497 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:39,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:39,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:39,708 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:39,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:39,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:39,709 INFO 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:53:39,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:39,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:39,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:53:39,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:39,731 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 21 treesize of output 24 [2019-02-25 15:53:39,739 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:53:39,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,751 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:39,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,764 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:39,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:39,776 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:39,792 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:53:39,793 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,818 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,838 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,855 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,869 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,883 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,921 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:39,921 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,930 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,940 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,957 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:39,989 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:53:39,989 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:53:40,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,064 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:40,065 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:40,154 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:53:40,155 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-25 15:53:40,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,190 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:40,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:53:40,191 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:40,208 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:53:40,209 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-02-25 15:53:40,223 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:53:40,223 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:40,275 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:53:40,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:40,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:53:40,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:40,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:53:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:53:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:40,296 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-02-25 15:53:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:40,725 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-02-25 15:53:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:40,726 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:53:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:40,730 INFO L225 Difference]: With dead ends: 319 [2019-02-25 15:53:40,730 INFO L226 Difference]: Without dead ends: 318 [2019-02-25 15:53:40,731 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:53:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-25 15:53:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-02-25 15:53:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-25 15:53:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-25 15:53:40,783 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-02-25 15:53:40,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:40,784 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-25 15:53:40,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:53:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-25 15:53:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:40,784 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:40,785 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:53:40,785 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:40,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:40,785 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-02-25 15:53:40,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:40,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:40,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:40,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:40,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:40,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:40,904 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:53:40,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:40,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:40,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:40,905 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-02-25 15:53:40,906 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:40,906 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:41,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:41,075 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:53:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:41,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:41,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:41,076 INFO 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:53:41,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:41,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:41,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:53:41,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:41,408 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:41,409 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,544 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,686 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:41,938 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:53:42,256 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:53:42,299 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:42,338 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:42,374 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:42,534 INFO L292 Elim1Store]: Index analysis took 158 ms [2019-02-25 15:53:42,535 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:53:42,535 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:42,917 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:43,192 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:43,400 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:43,577 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:43,742 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:43,857 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:53:43,858 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:53:43,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:43,940 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:43,941 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,108 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:53:44,109 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:53:44,125 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,126 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,127 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,128 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,130 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,131 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,132 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 62 [2019-02-25 15:53:44,132 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,160 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:53:44,160 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-02-25 15:53:44,177 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:53:44,177 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:44,193 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:53:44,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:44,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:53:44,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:44,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:53:44,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:53:44,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:53:44,213 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-02-25 15:53:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:44,427 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-02-25 15:53:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:53:44,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-25 15:53:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:44,431 INFO L225 Difference]: With dead ends: 290 [2019-02-25 15:53:44,432 INFO L226 Difference]: Without dead ends: 289 [2019-02-25 15:53:44,432 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:53:44,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-25 15:53:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-02-25 15:53:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-25 15:53:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-25 15:53:44,496 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-02-25 15:53:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:44,496 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-25 15:53:44,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:53:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-25 15:53:44,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:44,498 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:44,498 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-25 15:53:44,498 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:44,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:44,499 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-02-25 15:53:44,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:44,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:44,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:44,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:53:44,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:44,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:44,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:44,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:44,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:44,654 INFO 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:53:44,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:53:44,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:53:44,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:53:44,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:44,670 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:53:44,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:44,682 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 21 treesize of output 24 [2019-02-25 15:53:44,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,688 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 24 treesize of output 30 [2019-02-25 15:53:44,713 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,715 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 26 treesize of output 40 [2019-02-25 15:53:44,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,721 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 28 treesize of output 54 [2019-02-25 15:53:44,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,727 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:44,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:53:44,738 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:53:44,739 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,767 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,788 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,807 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,822 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,836 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,880 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:44,881 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,891 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,901 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,913 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,931 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:44,965 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:53:44,966 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-25 15:53:45,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,004 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:45,004 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,033 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:53:45,034 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:53:45,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,055 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,057 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:45,058 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,087 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:53:45,087 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:53:45,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,109 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,114 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,115 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,116 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2019-02-25 15:53:45,116 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,146 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:53:45,146 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-25 15:53:45,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:45,180 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 66 [2019-02-25 15:53:45,180 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:45,209 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:53:45,210 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-25 15:53:45,227 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:53:45,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:45,260 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:53:45,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:45,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 15:53:45,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:45,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:53:45,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:53:45,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:53:45,281 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-02-25 15:53:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:45,958 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-02-25 15:53:45,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:53:45,959 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:53:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:45,965 INFO L225 Difference]: With dead ends: 423 [2019-02-25 15:53:45,966 INFO L226 Difference]: Without dead ends: 421 [2019-02-25 15:53:45,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:53:45,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-02-25 15:53:46,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-02-25 15:53:46,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-25 15:53:46,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-02-25 15:53:46,116 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-02-25 15:53:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:46,117 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-02-25 15:53:46,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:53:46,117 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-02-25 15:53:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:46,118 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:46,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:53:46,118 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-02-25 15:53:46,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:46,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:46,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:46,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:46,303 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:53:46,458 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-25 15:53:46,471 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:53:46,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:46,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:46,472 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:46,472 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-02-25 15:53:46,474 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:46,474 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:46,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:46,790 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:46,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:46,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:46,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:46,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 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:53:46,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:46,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:46,805 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:53:46,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:46,808 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 21 treesize of output 24 [2019-02-25 15:53:46,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,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 24 treesize of output 30 [2019-02-25 15:53:46,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,821 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 26 treesize of output 40 [2019-02-25 15:53:46,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,830 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 28 treesize of output 54 [2019-02-25 15:53:46,839 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,846 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:53:46,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:46,861 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:53:46,861 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,908 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,933 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,952 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,966 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:46,980 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,035 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:53:47,036 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,062 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,074 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,091 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,110 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,139 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,187 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:53:47,187 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:53:47,221 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,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, 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:53:47,222 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,292 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:53:47,293 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:47,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,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, 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:53:47,327 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,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:53:47,367 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:47,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:47,412 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:47,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, 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:53:47,413 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:47,457 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:53:47,457 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:47,484 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:53:47,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:47,524 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:53:47,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:47,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:47,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:47,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:47,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:47,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:47,544 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-02-25 15:53:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:48,202 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-02-25 15:53:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:48,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:53:48,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:48,207 INFO L225 Difference]: With dead ends: 368 [2019-02-25 15:53:48,207 INFO L226 Difference]: Without dead ends: 366 [2019-02-25 15:53:48,207 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:53:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-25 15:53:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-02-25 15:53:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-25 15:53:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-02-25 15:53:48,272 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-02-25 15:53:48,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:48,272 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-02-25 15:53:48,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:48,273 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-02-25 15:53:48,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:48,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:48,274 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:53:48,275 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:48,275 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-02-25 15:53:48,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:48,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:48,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:48,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:48,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:48,343 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:53:48,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:48,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:48,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:53:48,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:53:48,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:48,344 INFO 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:53:48,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:53:48,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:53:48,359 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:53:48,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:53:48,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:53:48,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:48,367 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 21 treesize of output 24 [2019-02-25 15:53:48,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,370 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 24 treesize of output 30 [2019-02-25 15:53:48,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,382 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 26 treesize of output 40 [2019-02-25 15:53:48,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,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 28 treesize of output 54 [2019-02-25 15:53:48,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,403 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 30 treesize of output 72 [2019-02-25 15:53:48,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,413 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:53:48,414 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,456 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,478 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,497 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,513 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,527 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,586 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:53:48,587 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,603 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,616 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,635 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,663 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,692 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,740 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:53:48,740 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:53:48,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,770 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:53:48,770 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,815 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:53:48,816 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:48,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,848 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,850 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,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:53:48,852 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,896 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:53:48,896 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:48,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:48,931 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:48,931 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:53:48,932 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:48,974 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:53:48,975 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:49,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,006 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:49,019 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 45 treesize of output 93 [2019-02-25 15:53:49,020 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:49,063 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:53:49,063 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-02-25 15:53:49,088 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:53:49,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:49,133 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:53:49,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:49,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:53:49,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:49,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:53:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:53:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:53:49,153 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-02-25 15:53:49,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:49,966 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-02-25 15:53:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:53:49,967 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:53:49,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:49,971 INFO L225 Difference]: With dead ends: 407 [2019-02-25 15:53:49,971 INFO L226 Difference]: Without dead ends: 401 [2019-02-25 15:53:49,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:53:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-02-25 15:53:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-02-25 15:53:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-25 15:53:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-02-25 15:53:50,071 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-02-25 15:53:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:50,071 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-02-25 15:53:50,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:53:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-02-25 15:53:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:50,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:50,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:53:50,072 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:50,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:50,073 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-02-25 15:53:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:53:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:50,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:50,347 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-02-25 15:53:50,799 WARN L181 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-02-25 15:53:50,928 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:53:50,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:50,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:50,929 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:50,929 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-02-25 15:53:50,930 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:50,930 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:51,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:51,276 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:53:51,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:51,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:51,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:51,277 INFO 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:53:51,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:51,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:51,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:53:51,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:51,298 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 21 treesize of output 24 [2019-02-25 15:53:51,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:53:51,307 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,310 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 26 treesize of output 40 [2019-02-25 15:53:51,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,322 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 28 treesize of output 54 [2019-02-25 15:53:51,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,338 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 30 treesize of output 72 [2019-02-25 15:53:51,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,354 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:53:51,354 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,412 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,441 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,462 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,486 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,503 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,581 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:53:51,581 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,605 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,626 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,645 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,666 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,695 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,742 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:53:51,743 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:53:51,780 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,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, 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:53:51,782 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,827 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:53:51,828 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:53:51,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,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, 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:53:51,866 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,910 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:53:51,910 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:53:51,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:51,945 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:51,946 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:53:51,947 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:51,990 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:53:51,990 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:53:52,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:52,025 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:52,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, 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:53:52,027 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:52,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:53:52,071 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:53:52,094 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:53:52,094 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:52,189 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:53:52,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:52,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:53:52,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:52,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:53:52,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:53:52,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:53:52,208 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-02-25 15:53:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:55,035 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-02-25 15:53:55,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:53:55,036 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:53:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:55,042 INFO L225 Difference]: With dead ends: 645 [2019-02-25 15:53:55,043 INFO L226 Difference]: Without dead ends: 643 [2019-02-25 15:53:55,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:53:55,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-02-25 15:53:55,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-02-25 15:53:55,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-02-25 15:53:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-02-25 15:53:55,184 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-02-25 15:53:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:55,184 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-02-25 15:53:55,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:53:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-02-25 15:53:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:55,187 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:55,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:53:55,188 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:55,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:55,188 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-02-25 15:53:55,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:55,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:55,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:55,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:55,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:55,292 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:53:55,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:55,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:55,293 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:55,293 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-02-25 15:53:55,294 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:55,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:55,505 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:55,505 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:53:55,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:55,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:55,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:55,506 INFO 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:53:55,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:55,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:55,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:53:55,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:55,527 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 21 treesize of output 24 [2019-02-25 15:53:55,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, 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 26 [2019-02-25 15:53:55,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,542 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:55,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,557 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:55,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,564 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,569 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:55,586 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:53:55,586 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,616 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,637 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,654 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,667 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,681 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:53:55,719 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,727 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,737 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,753 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,784 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:53:55,785 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:53:55,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,827 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:53:55,828 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:55,854 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:53:55,854 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:53:55,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:55,895 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:55,896 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:53:55,979 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:53:55,979 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-02-25 15:53:56,991 WARN L181 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2019-02-25 15:53:56,994 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:53:56,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:57,011 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:53:57,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:57,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:53:57,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:57,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:53:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:53:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:53:57,030 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-02-25 15:53:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:57,588 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-02-25 15:53:57,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:53:57,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:53:57,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:57,595 INFO L225 Difference]: With dead ends: 527 [2019-02-25 15:53:57,595 INFO L226 Difference]: Without dead ends: 524 [2019-02-25 15:53:57,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:53:57,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-02-25 15:53:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-02-25 15:53:57,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-02-25 15:53:57,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-02-25 15:53:57,713 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-02-25 15:53:57,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:57,713 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-02-25 15:53:57,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:53:57,713 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-02-25 15:53:57,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:57,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:57,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:53:57,714 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-02-25 15:53:57,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:57,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:57,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:57,860 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:53:57,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:57,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:57,861 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:57,861 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-02-25 15:53:57,862 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:57,862 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:58,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:58,137 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:58,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:58,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:58,137 INFO 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:53:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:58,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:58,150 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:53:58,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:58,155 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 21 treesize of output 24 [2019-02-25 15:53:58,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,162 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 24 treesize of output 30 [2019-02-25 15:53:58,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,170 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 26 treesize of output 40 [2019-02-25 15:53:58,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,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 28 treesize of output 54 [2019-02-25 15:53:58,218 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,222 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,224 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,226 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,227 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 30 treesize of output 72 [2019-02-25 15:53:58,241 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:53:58,242 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,273 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,295 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,313 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,328 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,342 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,385 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:53:58,385 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,396 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,404 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,419 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,437 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,471 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:53:58,471 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:53:58,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,524 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:53:58,524 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,552 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:53:58,553 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:53:58,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,585 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:58,585 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,615 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:53:58,615 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-25 15:53:58,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:58,652 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:53:58,653 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:53:58,654 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:53:58,683 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:53:58,683 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:53:58,705 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:53:58,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:53:58,743 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:53:58,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:53:58,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:53:58,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:53:58,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:53:58,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:53:58,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:53:58,764 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-02-25 15:53:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:53:59,395 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-02-25 15:53:59,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:53:59,396 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:53:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:53:59,403 INFO L225 Difference]: With dead ends: 534 [2019-02-25 15:53:59,404 INFO L226 Difference]: Without dead ends: 533 [2019-02-25 15:53:59,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:53:59,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-02-25 15:53:59,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-02-25 15:53:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-02-25 15:53:59,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-02-25 15:53:59,540 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-02-25 15:53:59,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:53:59,540 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-02-25 15:53:59,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:53:59,541 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-02-25 15:53:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:53:59,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:53:59,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:53:59,542 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:53:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:59,542 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-02-25 15:53:59,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:53:59,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:59,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:53:59,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:53:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:59,614 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:53:59,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:53:59,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:53:59,615 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-02-25 15:53:59,617 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:53:59,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:53:59,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:53:59,907 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:53:59,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:53:59,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:53:59,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:53:59,908 INFO 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:53:59,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:53:59,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:53:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:53:59,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:53:59,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:53:59,935 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:53:59,939 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:53:59,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:53:59,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,964 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:53:59,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,981 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:53:59,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:53:59,996 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:53:59,996 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,036 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,058 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,075 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,087 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,099 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,153 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:54:00,153 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,167 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,183 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,206 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,232 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,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:54:00,277 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:54:00,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,309 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 41 treesize of output 87 [2019-02-25 15:54:00,310 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,351 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:54:00,352 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:54:00,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,432 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,434 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:54:00,434 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,475 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:54:00,476 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-25 15:54:00,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:00,516 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:00,517 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:54:00,517 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:00,555 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:54:00,555 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:54:00,577 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:54:00,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:00,616 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:54:00,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:00,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:00,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:00,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:00,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:00,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:00,637 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-02-25 15:54:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:01,303 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-02-25 15:54:01,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:01,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:54:01,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:01,309 INFO L225 Difference]: With dead ends: 543 [2019-02-25 15:54:01,309 INFO L226 Difference]: Without dead ends: 542 [2019-02-25 15:54:01,310 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:54:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-02-25 15:54:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-02-25 15:54:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-25 15:54:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-02-25 15:54:01,428 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-02-25 15:54:01,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:01,429 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-02-25 15:54:01,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-02-25 15:54:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:01,430 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:01,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:01,431 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:01,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:01,431 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-02-25 15:54:01,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:01,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:01,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:01,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:01,545 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:54:01,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:01,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:01,546 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:01,546 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-02-25 15:54:01,547 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:01,547 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:01,816 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:01,816 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:01,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:01,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:01,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:01,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:01,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:01,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:01,831 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:54:01,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:01,838 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 21 treesize of output 24 [2019-02-25 15:54:01,844 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:54:01,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,854 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:54:01,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,869 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:54:01,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,888 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:54:01,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:01,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:54:01,906 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,954 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,974 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:01,991 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,005 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,019 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,068 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:54:02,068 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,079 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,089 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,106 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,133 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,176 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:54:02,177 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:54:02,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:54:02,217 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,259 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:54:02,259 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:54:02,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,298 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:54:02,299 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,340 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:54:02,341 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-25 15:54:02,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:02,381 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:02,382 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:54:02,383 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:02,423 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:54:02,423 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:54:02,449 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:54:02,449 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:02,487 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:54:02,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:02,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:02,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:02,508 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-02-25 15:54:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:03,234 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-02-25 15:54:03,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:03,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:54:03,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:03,239 INFO L225 Difference]: With dead ends: 537 [2019-02-25 15:54:03,239 INFO L226 Difference]: Without dead ends: 536 [2019-02-25 15:54:03,240 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:54:03,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-02-25 15:54:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-02-25 15:54:03,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-02-25 15:54:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-02-25 15:54:03,358 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-02-25 15:54:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:03,358 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-02-25 15:54:03,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-02-25 15:54:03,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:03,360 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:03,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:03,360 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-02-25 15:54:03,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:03,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:03,361 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:03,688 WARN L181 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-25 15:54:03,731 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:54:03,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:03,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:03,732 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:03,732 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-02-25 15:54:03,733 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:03,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:04,063 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:04,063 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:04,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:04,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:04,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:04,064 INFO 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:54:04,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:04,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:04,105 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:54:04,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:04,125 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 21 treesize of output 24 [2019-02-25 15:54:04,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,170 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 24 treesize of output 30 [2019-02-25 15:54:04,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,232 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 26 treesize of output 40 [2019-02-25 15:54:04,270 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,321 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 28 treesize of output 54 [2019-02-25 15:54:04,359 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,403 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,405 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 30 treesize of output 72 [2019-02-25 15:54:04,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,414 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:54:04,415 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,456 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,478 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,498 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,512 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,526 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,582 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:54:04,583 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,598 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,605 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,618 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,641 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,670 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,717 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:54:04,718 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:54:04,753 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,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, 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:54:04,754 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,799 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:54:04,800 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:04,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,833 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:04,834 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:54:04,834 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,876 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:54:04,877 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:61 [2019-02-25 15:54:04,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,908 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:04,913 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:54:04,914 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:04,958 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:54:04,959 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-25 15:54:04,981 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:54:04,981 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:05,019 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:54:05,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:05,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:05,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:05,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:05,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:05,039 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-02-25 15:54:05,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:05,863 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-02-25 15:54:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:05,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:54:05,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:05,869 INFO L225 Difference]: With dead ends: 588 [2019-02-25 15:54:05,869 INFO L226 Difference]: Without dead ends: 587 [2019-02-25 15:54:05,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:05,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-02-25 15:54:05,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-02-25 15:54:05,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-02-25 15:54:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-02-25 15:54:05,997 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-02-25 15:54:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:05,997 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-02-25 15:54:05,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-02-25 15:54:05,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:05,998 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:05,999 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:05,999 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:05,999 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-02-25 15:54:05,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:06,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:06,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:06,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:06,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:06,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:06,068 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:54:06,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:06,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:06,068 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:06,069 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-02-25 15:54:06,069 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:06,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:06,475 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:06,475 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:06,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:06,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:06,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 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:54:06,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:06,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:06,518 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:06,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:06,534 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 21 treesize of output 24 [2019-02-25 15:54:06,573 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:54:06,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,662 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:54:06,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,776 INFO L292 Elim1Store]: Index analysis took 112 ms [2019-02-25 15:54:06,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:54:06,815 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,906 INFO L292 Elim1Store]: Index analysis took 128 ms [2019-02-25 15:54:06,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:54:06,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,957 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:06,976 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:54:06,976 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,013 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,036 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,053 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,067 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,081 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,130 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:54:07,131 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,144 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,160 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,183 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,210 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,253 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:54:07,253 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:54:07,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:07,282 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 41 treesize of output 87 [2019-02-25 15:54:07,283 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,328 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:54:07,329 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:54:07,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:07,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:07,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:07,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:07,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:07,360 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:07,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:54:07,361 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:07,433 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:54:07,434 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:57 [2019-02-25 15:54:07,455 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:54:07,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:07,479 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:54:07,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:07,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:54:07,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:07,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:07,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:07,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:07,498 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-02-25 15:54:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:08,003 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-02-25 15:54:08,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:54:08,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:54:08,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:08,007 INFO L225 Difference]: With dead ends: 558 [2019-02-25 15:54:08,008 INFO L226 Difference]: Without dead ends: 557 [2019-02-25 15:54:08,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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:54:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-02-25 15:54:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-02-25 15:54:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-02-25 15:54:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-02-25 15:54:08,131 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-02-25 15:54:08,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:08,131 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-02-25 15:54:08,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:08,131 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-02-25 15:54:08,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:08,132 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:08,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:08,133 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:08,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:08,133 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-02-25 15:54:08,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:08,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:08,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:08,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:08,216 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:54:08,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:08,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:08,217 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:08,217 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-02-25 15:54:08,218 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:08,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:08,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:08,529 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:08,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:08,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:08,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:08,529 INFO 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:54:08,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:08,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:08,544 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:08,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:08,581 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:08,582 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,602 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,618 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,633 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,653 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,678 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:54:08,681 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:54:08,685 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:54:08,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:54:08,692 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 30 treesize of output 72 [2019-02-25 15:54:08,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:54:08,702 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,729 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,750 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,767 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,780 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,793 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,825 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:54:08,826 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:54:08,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,864 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:08,865 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,894 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:54:08,895 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:54:08,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,921 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:08,921 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:54:08,922 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:08,948 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:54:08,949 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:44 [2019-02-25 15:54:08,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,970 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:08,977 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:54:08,978 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:09,005 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:54:09,006 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-25 15:54:09,025 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:54:09,025 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:09,049 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:54:09,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:09,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:54:09,070 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:09,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:09,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:09,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:09,070 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-02-25 15:54:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:09,805 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-02-25 15:54:09,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:54:09,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:54:09,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:09,811 INFO L225 Difference]: With dead ends: 795 [2019-02-25 15:54:09,811 INFO L226 Difference]: Without dead ends: 794 [2019-02-25 15:54:09,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:09,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-02-25 15:54:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-02-25 15:54:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-02-25 15:54:09,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-02-25 15:54:09,958 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-02-25 15:54:09,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:09,958 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-02-25 15:54:09,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:09,958 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-02-25 15:54:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:09,959 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:09,959 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:09,960 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:09,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:09,960 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-02-25 15:54:09,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:09,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:09,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:09,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:09,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:10,099 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-02-25 15:54:10,140 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:54:10,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:10,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:10,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:10,141 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-02-25 15:54:10,142 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:10,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:10,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:10,378 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:10,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:10,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:10,379 INFO 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:54:10,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:10,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:10,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:54:10,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:10,398 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 21 treesize of output 24 [2019-02-25 15:54:10,402 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:54:10,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,413 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:54:10,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,426 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:54:10,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,439 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,444 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:54:10,462 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:54:10,463 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,490 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,512 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,528 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,540 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,554 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,594 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:54:10,594 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,600 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,610 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,627 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,658 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:54:10,658 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:54:10,700 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:54:10,701 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:10,733 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:54:10,734 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:54:10,757 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,758 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,759 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:10,762 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:10,771 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:54:10,772 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:10,855 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:54:10,855 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:80 [2019-02-25 15:54:10,901 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:54:10,901 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:10,925 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:54:10,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:10,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-25 15:54:10,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:10,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:54:10,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:54:10,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:54:10,946 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-02-25 15:54:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:11,672 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-02-25 15:54:11,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:54:11,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:54:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:11,676 INFO L225 Difference]: With dead ends: 539 [2019-02-25 15:54:11,677 INFO L226 Difference]: Without dead ends: 538 [2019-02-25 15:54:11,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:54:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-02-25 15:54:11,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-02-25 15:54:11,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-25 15:54:11,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-02-25 15:54:11,886 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-02-25 15:54:11,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:11,886 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-02-25 15:54:11,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:54:11,886 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-02-25 15:54:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:11,887 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:11,887 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:54:11,887 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:11,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:11,888 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-02-25 15:54:11,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:11,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:11,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:11,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:12,014 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:54:12,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:12,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:12,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:12,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:12,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:12,015 INFO 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:54:12,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:12,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:12,031 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:12,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:12,035 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 21 treesize of output 24 [2019-02-25 15:54:12,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,039 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 24 treesize of output 30 [2019-02-25 15:54:12,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,049 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 26 treesize of output 40 [2019-02-25 15:54:12,054 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,058 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,058 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 28 treesize of output 54 [2019-02-25 15:54:12,063 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,067 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,069 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,069 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 30 treesize of output 72 [2019-02-25 15:54:12,081 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:54:12,082 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,124 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,149 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,167 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,182 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,196 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,240 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:12,241 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,251 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,260 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,272 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,290 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,324 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:54:12,324 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:54:12,551 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-25 15:54:12,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,572 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:54:12,572 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:12,681 INFO L301 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-02-25 15:54:12,681 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-25 15:54:12,918 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-25 15:54:12,923 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,925 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,928 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-02-25 15:54:12,928 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:12,994 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:12,998 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,003 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,016 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 2 case distinctions, treesize of input 65 treesize of output 79 [2019-02-25 15:54:13,017 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:13,132 INFO L301 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:54:13,132 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-02-25 15:54:13,356 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-02-25 15:54:13,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,380 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 69 [2019-02-25 15:54:13,380 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:13,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,467 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,469 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,473 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,476 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,478 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,482 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 55 treesize of output 79 [2019-02-25 15:54:13,483 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:13,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,577 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2019-02-25 15:54:13,577 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:13,654 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-02-25 15:54:13,654 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-02-25 15:54:13,870 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-25 15:54:13,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,893 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:13,918 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 6 case distinctions, treesize of input 55 treesize of output 93 [2019-02-25 15:54:13,921 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:54:14,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,188 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2019-02-25 15:54:14,188 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:14,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,331 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:14,338 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:14,339 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:54:14,339 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:14,466 INFO L301 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:54:14,467 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-02-25 15:54:14,667 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:54:14,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:14,748 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:54:14,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:14,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:54:14,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:14,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:54:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:54:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:14,768 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-02-25 15:54:14,985 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-02-25 15:54:15,641 WARN L181 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-02-25 15:54:16,148 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-02-25 15:54:16,664 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-02-25 15:54:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:17,532 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-02-25 15:54:17,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:54:17,532 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:54:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:17,538 INFO L225 Difference]: With dead ends: 678 [2019-02-25 15:54:17,538 INFO L226 Difference]: Without dead ends: 673 [2019-02-25 15:54:17,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:54:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-02-25 15:54:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-02-25 15:54:17,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-02-25 15:54:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-02-25 15:54:17,735 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-02-25 15:54:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:17,735 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-02-25 15:54:17,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:54:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-02-25 15:54:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:17,736 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:17,736 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:54:17,736 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:17,737 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-02-25 15:54:17,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:17,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:17,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:17,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:17,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:17,799 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:54:17,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:17,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:17,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:17,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:17,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:17,800 INFO 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:54:17,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:17,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:17,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:54:17,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:17,819 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:17,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:17,823 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 21 treesize of output 24 [2019-02-25 15:54:17,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,830 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 24 treesize of output 30 [2019-02-25 15:54:17,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,836 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 26 treesize of output 40 [2019-02-25 15:54:17,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,847 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,849 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,849 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 28 treesize of output 54 [2019-02-25 15:54:17,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,861 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 30 treesize of output 72 [2019-02-25 15:54:17,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:17,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:54:17,874 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,915 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,938 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,956 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,972 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:17,985 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,042 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:54:18,043 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,060 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,069 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,084 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,108 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,138 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,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:54:18,186 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:54:18,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,218 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:54:18,218 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,263 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:54:18,263 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:18,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,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, 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:54:18,293 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,338 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:54:18,338 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:18,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,361 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,362 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,363 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,365 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,372 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 43 treesize of output 91 [2019-02-25 15:54:18,373 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,417 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:54:18,418 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-02-25 15:54:18,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,442 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:18,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, 21 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:54:18,454 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:18,498 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:54:18,498 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-02-25 15:54:18,524 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:54:18,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:18,572 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:54:18,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:18,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:54:18,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:18,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:54:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:54:18,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:18,593 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-02-25 15:54:19,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:19,466 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-02-25 15:54:19,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:54:19,466 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-25 15:54:19,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:19,472 INFO L225 Difference]: With dead ends: 704 [2019-02-25 15:54:19,472 INFO L226 Difference]: Without dead ends: 703 [2019-02-25 15:54:19,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:54:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-02-25 15:54:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-02-25 15:54:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-02-25 15:54:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-02-25 15:54:19,715 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-02-25 15:54:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:19,715 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-02-25 15:54:19,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:54:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-02-25 15:54:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:19,716 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:19,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:19,717 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-02-25 15:54:19,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:19,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:19,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:19,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:19,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:19,899 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:54:19,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:19,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:19,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:19,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:19,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:19,900 INFO 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:54:19,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:19,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:19,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:54:19,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:19,917 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:19,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:19,920 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 21 treesize of output 24 [2019-02-25 15:54:19,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,927 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 24 treesize of output 30 [2019-02-25 15:54:19,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,932 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 26 treesize of output 40 [2019-02-25 15:54:19,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,939 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,941 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,941 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:54:19,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,954 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:54:19,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,960 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,962 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,963 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:19,965 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:54:19,965 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,005 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,030 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,047 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,062 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,076 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,134 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:54:20,134 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,152 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,162 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,177 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,200 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,230 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,277 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:54:20,278 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:54:20,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,318 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:54:20,319 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,396 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:54:20,396 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:20,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,430 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:54:20,431 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,472 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:54:20,472 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:20,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,508 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:20,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 43 treesize of output 93 [2019-02-25 15:54:20,509 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,552 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:54:20,553 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:20,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,580 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,581 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,582 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,583 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:20,590 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:20,591 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:54:20,592 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:20,633 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:54:20,634 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:54:20,661 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:54:20,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:20,711 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:54:20,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:20,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:54:20,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:20,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:54:20,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:54:20,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:20,730 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-02-25 15:54:22,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:22,072 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-02-25 15:54:22,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:54:22,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:54:22,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:22,078 INFO L225 Difference]: With dead ends: 1218 [2019-02-25 15:54:22,078 INFO L226 Difference]: Without dead ends: 1217 [2019-02-25 15:54:22,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:54:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-02-25 15:54:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-02-25 15:54:22,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-02-25 15:54:22,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-02-25 15:54:22,403 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-02-25 15:54:22,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:22,404 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-02-25 15:54:22,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:54:22,404 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-02-25 15:54:22,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:22,405 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:22,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:22,405 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:22,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:22,405 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-02-25 15:54:22,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:22,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:22,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:22,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:22,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:22,561 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-25 15:54:22,588 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:54:22,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:22,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:22,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:22,589 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-02-25 15:54:22,590 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:22,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:22,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:22,876 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:22,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:22,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:22,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:22,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:22,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:22,895 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:54:22,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:22,903 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 21 treesize of output 24 [2019-02-25 15:54:22,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:54:22,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,916 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 26 treesize of output 40 [2019-02-25 15:54:22,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,929 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 28 treesize of output 54 [2019-02-25 15:54:22,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,940 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,942 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,942 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:54:22,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,958 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:22,958 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:54:22,959 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,002 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,026 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,045 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,059 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,073 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,334 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:54:23,335 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,351 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,363 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,380 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,405 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,434 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,487 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:54:23,488 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:54:23,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,524 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:54:23,524 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,603 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:54:23,603 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:23,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,635 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,637 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:23,638 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:54:23,638 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,680 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:54:23,680 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-02-25 15:54:23,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,708 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,709 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,715 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:23,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, 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:54:23,717 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:23,760 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:54:23,760 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-02-25 15:54:23,786 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:54:23,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:23,824 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:54:23,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:23,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:23,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:23,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:23,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:23,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:23,845 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-02-25 15:54:24,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:24,662 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-02-25 15:54:24,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:24,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:54:24,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:24,667 INFO L225 Difference]: With dead ends: 814 [2019-02-25 15:54:24,667 INFO L226 Difference]: Without dead ends: 811 [2019-02-25 15:54:24,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:24,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-25 15:54:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-02-25 15:54:24,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-02-25 15:54:24,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-02-25 15:54:24,962 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-02-25 15:54:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:24,962 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-02-25 15:54:24,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-02-25 15:54:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:24,964 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:24,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:24,964 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:24,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:24,964 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-02-25 15:54:24,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:24,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:24,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:24,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:24,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:25,054 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:54:25,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:25,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:25,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:25,055 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-02-25 15:54:25,056 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:25,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:25,327 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:25,327 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:25,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:25,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:25,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:25,328 INFO 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:54:25,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:25,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:25,355 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:25,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:25,426 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:25,426 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,438 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,452 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,469 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,489 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,514 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 21 treesize of output 24 [2019-02-25 15:54:25,517 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 24 treesize of output 30 [2019-02-25 15:54:25,520 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:54:25,522 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:54:25,525 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 30 treesize of output 72 [2019-02-25 15:54:25,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:54:25,534 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,562 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,583 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,599 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,612 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,624 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,658 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:54:25,658 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:54:25,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:25,715 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,743 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:54:25,743 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:54:25,770 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,771 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,772 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,773 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,774 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,774 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:25,775 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:25,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,802 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:54:25,803 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:54:25,870 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:25,936 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:25,936 INFO L292 Elim1Store]: Index analysis took 111 ms [2019-02-25 15:54:25,937 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:25,937 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:25,965 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:54:25,965 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-25 15:54:26,022 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:54:26,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:26,056 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:54:26,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:26,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-25 15:54:26,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:26,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:54:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:54:26,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:54:26,075 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-02-25 15:54:26,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:26,973 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-02-25 15:54:26,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:26,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-25 15:54:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:26,976 INFO L225 Difference]: With dead ends: 812 [2019-02-25 15:54:26,976 INFO L226 Difference]: Without dead ends: 811 [2019-02-25 15:54:26,977 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:54:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-25 15:54:27,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-02-25 15:54:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-02-25 15:54:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-02-25 15:54:27,276 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-02-25 15:54:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:27,276 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-02-25 15:54:27,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:54:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-02-25 15:54:27,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:27,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:27,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:27,278 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-02-25 15:54:27,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:27,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:27,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:27,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:54:27,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:27,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:27,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:27,363 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-02-25 15:54:27,364 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:27,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:27,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:27,592 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:27,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:27,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:27,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:27,593 INFO 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:54:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:27,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:27,607 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:54:27,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:27,613 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:54:27,621 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:54:27,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,634 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:54:27,642 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,647 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:54:27,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,659 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:54:27,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:27,679 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:54:27,680 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,736 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,757 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,774 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,788 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,802 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,869 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:54:27,870 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,900 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,914 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,933 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:27,959 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,004 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:54:28,004 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:54:28,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,046 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 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:54:28,048 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:28,189 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:54:28,190 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:122 [2019-02-25 15:54:28,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,236 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:28,238 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:28,239 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:28,275 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:54:28,275 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-25 15:54:28,296 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:54:28,296 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:28,312 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:54:28,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:28,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:54:28,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:28,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:28,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:28,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:54:28,333 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-02-25 15:54:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:29,008 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-02-25 15:54:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:29,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:54:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:29,011 INFO L225 Difference]: With dead ends: 843 [2019-02-25 15:54:29,011 INFO L226 Difference]: Without dead ends: 842 [2019-02-25 15:54:29,012 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:54:29,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-02-25 15:54:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-02-25 15:54:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-02-25 15:54:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-02-25 15:54:29,364 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-02-25 15:54:29,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:29,364 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-02-25 15:54:29,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-02-25 15:54:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:29,365 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:29,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:29,366 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:29,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:29,366 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-02-25 15:54:29,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:29,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:29,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:29,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:29,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:29,449 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:54:29,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:29,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:29,450 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:29,450 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-02-25 15:54:29,451 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:29,451 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:29,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:29,743 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:29,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:29,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:29,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:29,744 INFO 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:54:29,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:29,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:29,759 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:29,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:29,800 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:29,800 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,824 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,838 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,853 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,880 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,910 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:54:29,913 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 24 treesize of output 30 [2019-02-25 15:54:29,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:54:29,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:54:29,922 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 15:54:29,929 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:54:29,929 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,956 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,976 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:29,993 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,005 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,017 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,050 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:54:30,051 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:54:30,150 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:54:30,160 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:30,267 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:54:30,267 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-25 15:54:30,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,375 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,416 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 8 case distinctions, treesize of input 65 treesize of output 91 [2019-02-25 15:54:30,419 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-25 15:54:30,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:30,720 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:30,721 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 82 [2019-02-25 15:54:30,722 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:30,886 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-02-25 15:54:30,887 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-02-25 15:54:31,419 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-02-25 15:54:31,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2019-02-25 15:54:31,426 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,551 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,552 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,553 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,554 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,555 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:31,556 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2019-02-25 15:54:31,556 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,679 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:31,679 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 74 [2019-02-25 15:54:31,680 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,791 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,792 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:31,800 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:31,801 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 15:54:31,801 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:31,895 INFO L301 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-02-25 15:54:31,896 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-02-25 15:54:32,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:54:32,018 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:32,075 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:54:32,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:32,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:32,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:32,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:32,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:32,096 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-02-25 15:54:32,279 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-02-25 15:54:32,578 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-25 15:54:32,791 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-02-25 15:54:32,992 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-02-25 15:54:33,616 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-02-25 15:54:33,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:33,928 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-02-25 15:54:33,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:54:33,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:54:33,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:33,933 INFO L225 Difference]: With dead ends: 896 [2019-02-25 15:54:33,933 INFO L226 Difference]: Without dead ends: 895 [2019-02-25 15:54:33,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:54:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-02-25 15:54:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-02-25 15:54:34,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-02-25 15:54:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-02-25 15:54:34,300 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-02-25 15:54:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:34,300 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-02-25 15:54:34,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:34,300 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-02-25 15:54:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:34,302 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:34,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:34,302 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:34,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:34,302 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-02-25 15:54:34,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:34,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:34,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:34,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:34,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:34,381 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:54:34,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:34,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:34,382 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:34,382 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-02-25 15:54:34,384 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:34,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:34,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:34,654 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:54:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:34,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:34,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:34,655 INFO 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:54:34,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:34,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:34,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:34,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:54:34,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:34,705 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:34,705 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,724 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,737 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,755 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,775 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,799 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 21 treesize of output 24 [2019-02-25 15:54:34,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 15:54:34,805 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:54:34,808 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:54:34,811 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 30 treesize of output 72 [2019-02-25 15:54:34,818 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:54:34,818 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,846 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,865 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,881 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,893 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,905 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:34,939 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:54:34,939 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-25 15:54:34,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:34,981 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:34,982 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,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:54:35,012 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-25 15:54:35,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:35,040 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,068 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:54:35,069 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-25 15:54:35,090 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:35,097 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:35,098 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:54:35,098 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:35,126 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:54:35,127 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-25 15:54:35,146 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:54:35,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:35,178 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:54:35,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:35,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:54:35,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:35,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:54:35,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:54:35,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:35,200 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-02-25 15:54:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:36,166 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-02-25 15:54:36,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:54:36,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:54:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:36,170 INFO L225 Difference]: With dead ends: 975 [2019-02-25 15:54:36,170 INFO L226 Difference]: Without dead ends: 973 [2019-02-25 15:54:36,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-02-25 15:54:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-02-25 15:54:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-02-25 15:54:36,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-02-25 15:54:36,571 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-02-25 15:54:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:36,572 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-02-25 15:54:36,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:54:36,572 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-02-25 15:54:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:36,574 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:36,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:36,574 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:36,574 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-02-25 15:54:36,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:36,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:36,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:36,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:36,687 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:54:36,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:36,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:36,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:36,688 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-02-25 15:54:36,689 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:36,689 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:36,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:36,925 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:54:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:36,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:36,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:36,925 INFO 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:54:36,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:36,935 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:36,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:54:36,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:36,943 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 21 treesize of output 24 [2019-02-25 15:54:36,947 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:54:36,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,954 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:54:36,964 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,966 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,968 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:54:36,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:36,983 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:54:36,998 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:54:36,999 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,035 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,056 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,073 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,085 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,098 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,138 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:54:37,138 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,226 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,235 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,252 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,283 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:54:37,283 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:54:37,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:37,327 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:37,436 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:54:37,436 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-25 15:54:37,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,519 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 82 [2019-02-25 15:54:37,519 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:37,593 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:37,594 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2019-02-25 15:54:37,594 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:37,632 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:54:37,632 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:84 [2019-02-25 15:54:37,698 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:54:37,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:54:37,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:37,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:54:37,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:37,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:54:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:54:37,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:54:37,742 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-02-25 15:54:38,077 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 75 [2019-02-25 15:54:38,292 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-02-25 15:54:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:39,010 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-02-25 15:54:39,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:54:39,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:54:39,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:39,013 INFO L225 Difference]: With dead ends: 985 [2019-02-25 15:54:39,013 INFO L226 Difference]: Without dead ends: 984 [2019-02-25 15:54:39,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:54:39,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-02-25 15:54:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-02-25 15:54:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-02-25 15:54:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-02-25 15:54:39,386 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-02-25 15:54:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:39,386 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-02-25 15:54:39,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:54:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-02-25 15:54:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:39,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:39,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:39,388 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:39,388 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-02-25 15:54:39,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:39,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:39,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:39,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:39,489 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:54:39,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:39,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:39,490 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:39,490 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-02-25 15:54:39,491 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:39,491 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:39,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:39,871 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:54:39,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:39,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:39,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:39,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:39,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:39,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:39,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:39,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:39,983 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:54:39,984 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,008 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,015 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,030 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,052 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,082 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,118 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 21 treesize of output 24 [2019-02-25 15:54:40,121 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 24 treesize of output 30 [2019-02-25 15:54:40,124 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 26 treesize of output 40 [2019-02-25 15:54:40,125 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 28 treesize of output 54 [2019-02-25 15:54:40,128 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 30 treesize of output 72 [2019-02-25 15:54:40,131 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:54:40,131 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,165 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,184 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,201 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,214 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,226 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,272 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:40,273 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:54:40,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,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:54:40,317 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,358 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:54:40,359 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:40,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,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:54:40,402 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,445 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:54:40,446 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:40,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,482 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,489 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:40,490 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:54:40,490 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,531 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:54:40,531 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:40,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,562 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,567 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:40,572 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:40,573 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:54:40,573 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:40,614 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:54:40,614 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:54:40,642 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:54:40,642 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:40,826 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:54:40,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:40,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:54:40,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:40,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:54:40,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:54:40,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:40,846 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-02-25 15:54:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:45,049 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-02-25 15:54:45,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:54:45,049 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:54:45,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:45,054 INFO L225 Difference]: With dead ends: 1024 [2019-02-25 15:54:45,054 INFO L226 Difference]: Without dead ends: 1023 [2019-02-25 15:54:45,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:54:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-02-25 15:54:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-02-25 15:54:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-02-25 15:54:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-02-25 15:54:45,432 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-02-25 15:54:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:45,432 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-02-25 15:54:45,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:54:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-02-25 15:54:45,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:45,433 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:45,433 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:45,434 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:45,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:45,434 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-02-25 15:54:45,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:45,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:45,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:45,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:45,610 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:54:45,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:45,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:45,611 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:45,611 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-02-25 15:54:45,612 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:45,612 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:45,988 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:45,988 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:54:45,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:45,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:45,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:45,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:45,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:45,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:46,002 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:46,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:46,006 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 21 treesize of output 24 [2019-02-25 15:54:46,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,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 24 treesize of output 30 [2019-02-25 15:54:46,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,038 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,038 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 26 treesize of output 40 [2019-02-25 15:54:46,048 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,053 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,053 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 28 treesize of output 54 [2019-02-25 15:54:46,056 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,059 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,061 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,064 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 30 treesize of output 72 [2019-02-25 15:54:46,072 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,076 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,077 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,077 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,078 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:54:46,078 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,120 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,143 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,162 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,177 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,190 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,245 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:54:46,246 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,260 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,270 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,288 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,311 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,340 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,387 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:46,387 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:54:46,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,431 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:54:46,431 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,474 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:46,474 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:46,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,515 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:54:46,515 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,558 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:54:46,559 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:46,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,602 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:46,603 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:54:46,603 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,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:54:46,646 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:46,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:46,687 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:46,688 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:54:46,689 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:46,730 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:54:46,730 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-25 15:54:46,755 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:54:46,755 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:46,811 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:54:46,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:46,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:54:46,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:46,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:54:46,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:54:46,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:54:46,831 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-02-25 15:54:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:48,201 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-02-25 15:54:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:54:48,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:54:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:48,206 INFO L225 Difference]: With dead ends: 1059 [2019-02-25 15:54:48,206 INFO L226 Difference]: Without dead ends: 1057 [2019-02-25 15:54:48,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:54:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-02-25 15:54:48,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-02-25 15:54:48,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-02-25 15:54:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-02-25 15:54:48,637 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-02-25 15:54:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:48,638 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-02-25 15:54:48,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:54:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-02-25 15:54:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:48,639 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:48,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:48,640 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-02-25 15:54:48,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:48,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:48,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:48,813 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:54:48,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:48,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:48,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:48,813 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-02-25 15:54:48,816 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:48,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:49,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:49,181 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:54:49,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:49,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:49,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:49,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:49,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:49,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:49,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:49,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:49,200 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 21 treesize of output 24 [2019-02-25 15:54:49,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,207 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 24 treesize of output 30 [2019-02-25 15:54:49,215 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,217 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,217 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 26 treesize of output 40 [2019-02-25 15:54:49,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,225 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,227 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 28 treesize of output 54 [2019-02-25 15:54:49,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,239 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,241 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,242 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 30 treesize of output 72 [2019-02-25 15:54:49,266 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:54:49,267 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,300 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,322 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,340 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,355 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,368 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,413 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:49,414 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,424 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,436 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,452 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,471 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,502 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:49,503 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-25 15:54:49,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,571 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:49,571 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,598 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:49,598 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:54:49,629 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,630 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,634 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:54:49,635 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,663 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:54:49,663 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-25 15:54:49,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,693 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:49,694 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:54:49,694 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,719 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:54:49,720 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:54:49,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,750 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:49,751 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:49,752 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:54:49,753 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:49,780 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:54:49,780 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-25 15:54:49,800 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:54:49,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:49,859 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:54:49,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:49,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:54:49,878 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:49,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:54:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:54:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:49,879 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-02-25 15:54:52,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:52,046 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-02-25 15:54:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:54:52,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:54:52,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:52,051 INFO L225 Difference]: With dead ends: 1044 [2019-02-25 15:54:52,051 INFO L226 Difference]: Without dead ends: 1042 [2019-02-25 15:54:52,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:54:52,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-02-25 15:54:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-02-25 15:54:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-02-25 15:54:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-02-25 15:54:52,444 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-02-25 15:54:52,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:52,444 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-02-25 15:54:52,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:54:52,444 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-02-25 15:54:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:52,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:52,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:52,446 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:52,446 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-02-25 15:54:52,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:52,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:52,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:52,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:52,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:52,565 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:54:52,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:52,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:52,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:54:52,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:54:52,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:52,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:52,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:54:52,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:54:52,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:54:52,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:54:52,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:54:52,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:52,621 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:54:52,621 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,637 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,646 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,661 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,685 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,720 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,761 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 21 treesize of output 24 [2019-02-25 15:54:52,767 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 24 treesize of output 30 [2019-02-25 15:54:52,769 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 26 treesize of output 40 [2019-02-25 15:54:52,772 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 28 treesize of output 54 [2019-02-25 15:54:52,777 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 30 treesize of output 72 [2019-02-25 15:54:52,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, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:54:52,783 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,835 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,863 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,886 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,906 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,920 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:52,969 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:54:52,970 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:54:53,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,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, 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:54:53,015 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,069 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:54:53,070 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:54:53,142 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,165 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,259 INFO L292 Elim1Store]: Index analysis took 154 ms [2019-02-25 15:54:53,260 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:54:53,260 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,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:54:53,302 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 15:54:53,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,340 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,341 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,343 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,344 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,345 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,346 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,347 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:53,348 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:54:53,348 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,388 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:54:53,388 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:54:53,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,423 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,424 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,429 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:53,431 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:53,432 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:54:53,432 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:53,498 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:54:53,499 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:54:53,524 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:54:53,524 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:53,628 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:54:53,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:53,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:54:53,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:53,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:54:53,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:54:53,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:53,648 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-02-25 15:54:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:54:54,931 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-02-25 15:54:54,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:54:54,931 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:54:54,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:54:54,936 INFO L225 Difference]: With dead ends: 1044 [2019-02-25 15:54:54,936 INFO L226 Difference]: Without dead ends: 1041 [2019-02-25 15:54:54,936 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:54:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-02-25 15:54:55,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-02-25 15:54:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-02-25 15:54:55,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-02-25 15:54:55,330 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-02-25 15:54:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:54:55,331 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-02-25 15:54:55,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:54:55,331 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-02-25 15:54:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:54:55,332 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:54:55,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:54:55,332 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:54:55,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:55,333 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-02-25 15:54:55,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:54:55,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:55,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:54:55,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:54:55,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:54:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:55,411 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:54:55,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:55,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:54:55,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:54:55,412 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-02-25 15:54:55,413 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:54:55,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:54:55,749 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:54:55,749 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:54:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:54:55,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:54:55,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:54:55,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:54:55,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:54:55,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:54:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:54:55,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:54:55,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:54:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:54:55,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,777 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 24 treesize of output 30 [2019-02-25 15:54:55,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:54:55,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,805 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 28 treesize of output 54 [2019-02-25 15:54:55,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,811 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,814 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:55,816 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 30 treesize of output 72 [2019-02-25 15:54:55,834 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:54:55,834 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,862 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,886 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,903 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,918 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,931 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,973 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:54:55,974 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,982 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:55,990 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,001 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,020 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,053 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:54:56,053 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:54:56,156 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,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, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 15:54:56,166 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:56,267 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:54:56,268 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-25 15:54:56,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,394 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:56,403 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 79 [2019-02-25 15:54:56,404 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:56,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,530 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,533 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:56,534 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-02-25 15:54:56,534 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,616 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-25 15:54:56,617 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-02-25 15:54:56,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,750 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 77 [2019-02-25 15:54:56,751 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,877 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,879 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,880 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,882 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,887 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 74 [2019-02-25 15:54:56,887 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:56,972 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,975 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,981 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:56,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 83 [2019-02-25 15:54:56,995 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-02-25 15:54:57,129 INFO L301 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-02-25 15:54:57,129 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-02-25 15:54:57,260 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-02-25 15:54:57,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,267 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,268 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,269 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,272 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,277 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 74 [2019-02-25 15:54:57,278 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:57,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,395 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,398 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,400 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:57,400 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-25 15:54:57,401 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:57,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,511 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:57,512 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-25 15:54:57,512 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:54:57,613 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,615 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,616 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,617 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,621 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,623 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,625 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,627 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,628 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,631 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:54:57,634 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:54:57,650 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 4 case distinctions, treesize of input 51 treesize of output 93 [2019-02-25 15:54:57,651 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-02-25 15:54:57,881 INFO L301 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-02-25 15:54:57,882 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:236 [2019-02-25 15:54:58,115 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-02-25 15:54:58,117 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:54:58,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:54:58,244 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:54:58,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:54:58,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:54:58,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:54:58,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:54:58,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:54:58,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:54:58,264 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-02-25 15:54:58,446 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-25 15:54:58,714 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-25 15:54:59,132 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-02-25 15:54:59,579 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 76 [2019-02-25 15:55:00,506 WARN L181 SmtUtils]: Spent 598.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 88 [2019-02-25 15:55:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:01,406 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-02-25 15:55:01,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:01,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:55:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:01,411 INFO L225 Difference]: With dead ends: 1104 [2019-02-25 15:55:01,411 INFO L226 Difference]: Without dead ends: 1102 [2019-02-25 15:55:01,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:55:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-02-25 15:55:01,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-02-25 15:55:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-02-25 15:55:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-02-25 15:55:01,821 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-02-25 15:55:01,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:01,821 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-02-25 15:55:01,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:55:01,822 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-02-25 15:55:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:01,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:01,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:01,823 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:01,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:01,823 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-02-25 15:55:01,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:01,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:01,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:01,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:01,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:01,928 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:55:01,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:01,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:01,929 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:01,929 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-02-25 15:55:01,929 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:01,929 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:02,316 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:02,316 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:55:02,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:02,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:02,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:02,316 INFO 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:55:02,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:02,326 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:02,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:55:02,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:02,375 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:55:02,375 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,398 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,417 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,437 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,461 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,492 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 21 treesize of output 24 [2019-02-25 15:55:02,494 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 24 treesize of output 30 [2019-02-25 15:55:02,497 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:55:02,499 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:55:02,502 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 30 treesize of output 72 [2019-02-25 15:55:02,509 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:55:02,510 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,537 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,558 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,574 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,586 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,598 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,631 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:55:02,632 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 15:55:02,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:55:02,688 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,715 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:55:02,716 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 15:55:02,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,746 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:02,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:55:02,747 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,775 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:55:02,775 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-02-25 15:55:02,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,802 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,807 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:55:02,807 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,835 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:55:02,835 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-25 15:55:02,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:02,867 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:02,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:55:02,868 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:02,894 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:55:02,895 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:36 [2019-02-25 15:55:02,914 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:55:02,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:02,984 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:55:03,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:03,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:55:03,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:03,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:55:03,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:55:03,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:03,004 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-02-25 15:55:05,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:05,483 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-02-25 15:55:05,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:55:05,484 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:55:05,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:05,489 INFO L225 Difference]: With dead ends: 1313 [2019-02-25 15:55:05,489 INFO L226 Difference]: Without dead ends: 1312 [2019-02-25 15:55:05,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:55:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-02-25 15:55:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-02-25 15:55:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-02-25 15:55:05,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-02-25 15:55:05,905 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-02-25 15:55:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:05,906 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-02-25 15:55:05,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:55:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-02-25 15:55:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:05,907 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:05,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:05,907 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:05,908 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-02-25 15:55:05,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:05,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:05,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:05,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:05,963 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:55:05,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:05,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:05,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:05,964 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-02-25 15:55:05,965 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:05,965 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:06,242 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:06,242 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:06,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:06,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:06,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:06,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:06,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:06,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:06,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:06,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:06,260 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 21 treesize of output 24 [2019-02-25 15:55:06,269 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:55:06,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:55:06,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,291 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:55:06,297 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,301 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,305 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:55:06,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:55:06,324 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,364 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,425 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,444 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,456 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,470 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,521 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:55:06,521 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,535 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,547 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,565 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,592 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,634 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:55:06,635 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:55:06,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,668 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 41 treesize of output 87 [2019-02-25 15:55:06,668 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,710 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:55:06,710 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:55:06,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,741 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,743 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:55:06,748 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,785 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:55:06,785 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-25 15:55:06,852 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,869 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,871 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:06,872 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:06,873 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:55:06,873 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:06,912 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:55:06,912 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:55:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:55:06,939 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:06,976 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:55:06,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:06,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:55:06,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:06,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:06,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:06,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:06,996 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-02-25 15:55:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:08,111 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-02-25 15:55:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:55:08,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:55:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:08,115 INFO L225 Difference]: With dead ends: 881 [2019-02-25 15:55:08,115 INFO L226 Difference]: Without dead ends: 880 [2019-02-25 15:55:08,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:55:08,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-02-25 15:55:08,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-02-25 15:55:08,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-02-25 15:55:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-02-25 15:55:08,510 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-02-25 15:55:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:08,510 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-02-25 15:55:08,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-02-25 15:55:08,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:08,512 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:08,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:08,512 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:08,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:08,512 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-02-25 15:55:08,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:08,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:08,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:08,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:08,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:08,597 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:55:08,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:08,597 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:08,597 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:08,597 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-02-25 15:55:08,598 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:08,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:08,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:08,859 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:08,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:08,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:08,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:08,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:08,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:08,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:08,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:55:08,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:08,879 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 21 treesize of output 24 [2019-02-25 15:55:08,885 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:55:08,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:55:08,905 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,907 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,909 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,909 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:55:08,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,917 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,919 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,921 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:08,921 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:55:08,939 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:55:08,940 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,972 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:08,993 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,009 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,022 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,035 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,074 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:55:09,075 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:55: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:55:09,096 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,113 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,144 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:55:09,144 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:55:09,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,186 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:55:09,186 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,213 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:55:09,213 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-25 15:55:09,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,234 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,235 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,237 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,238 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,247 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:55:09,248 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:09,329 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:55:09,329 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:68 [2019-02-25 15:55:09,366 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,367 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,369 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,370 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:09,371 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:09,371 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:55:09,372 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:09,389 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:55:09,390 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-25 15:55:09,408 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:55:09,409 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:09,434 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:55:09,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:09,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:55:09,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:09,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:09,454 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-02-25 15:55:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:10,700 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-02-25 15:55:10,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:10,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:55:10,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:10,705 INFO L225 Difference]: With dead ends: 1415 [2019-02-25 15:55:10,705 INFO L226 Difference]: Without dead ends: 1413 [2019-02-25 15:55:10,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-02-25 15:55:11,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-02-25 15:55:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-02-25 15:55:11,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-02-25 15:55:11,370 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-02-25 15:55:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:11,370 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-02-25 15:55:11,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-02-25 15:55:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:11,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:11,372 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:11,373 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-02-25 15:55:11,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:11,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:11,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:11,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:11,457 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:55:11,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:11,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:11,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:11,458 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-02-25 15:55:11,458 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:11,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:11,734 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:11,734 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:55:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:11,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:11,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:11,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:11,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:11,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:11,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:55:11,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:11,774 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:55:11,775 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,790 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,802 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,822 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,845 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:55:11,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, 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 26 [2019-02-25 15:55:11,852 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:55:11,858 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:55:11,860 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:55:11,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, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:55:11,871 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,894 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,913 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,926 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,938 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,950 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:11,981 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:55:11,982 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 15:55:12,196 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-25 15:55:12,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,249 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:55:12,257 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-25 15:55:12,612 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-02-25 15:55:12,612 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:433 [2019-02-25 15:55:12,769 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 211 DAG size of output: 92 [2019-02-25 15:55:12,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,777 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2019-02-25 15:55:12,777 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:12,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:12,870 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:12,878 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 80 [2019-02-25 15:55:12,879 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:13,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,023 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:13,032 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 68 [2019-02-25 15:55:13,033 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:13,167 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-02-25 15:55:13,167 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:198, output treesize:184 [2019-02-25 15:55:13,507 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-02-25 15:55:13,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,525 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,528 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-25 15:55:13,528 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 53 [2019-02-25 15:55:13,609 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:13,662 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:13,663 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-25 15:55:13,663 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:13,708 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-25 15:55:13,708 INFO L208 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-02-25 15:55:13,820 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:55:13,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:13,868 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:55:13,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:13,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:55:13,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:13,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:55:13,889 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-02-25 15:55:14,316 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-25 15:55:14,936 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-02-25 15:55:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:15,762 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-02-25 15:55:15,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:55:15,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:55:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:15,767 INFO L225 Difference]: With dead ends: 1381 [2019-02-25 15:55:15,768 INFO L226 Difference]: Without dead ends: 1379 [2019-02-25 15:55:15,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:55:15,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-02-25 15:55:16,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-02-25 15:55:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-25 15:55:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-25 15:55:16,426 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-25 15:55:16,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:16,426 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-25 15:55:16,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:16,426 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-25 15:55:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:16,428 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:16,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:16,429 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:16,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:16,429 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-02-25 15:55:16,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:16,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:16,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:16,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:16,483 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:55:16,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:16,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:16,483 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:16,483 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-02-25 15:55:16,484 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:16,484 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:16,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:16,989 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:55:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:16,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:16,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:16,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:17,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:17,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:17,004 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:55:17,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:17,048 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:55:17,048 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,068 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,086 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,107 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,135 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,171 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 21 treesize of output 24 [2019-02-25 15:55:17,174 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:55:17,178 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:55:17,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, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:55:17,185 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:55:17,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:55:17,190 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,225 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,244 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,259 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,271 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,283 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,327 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:55:17,327 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:55:17,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:17,355 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 41 treesize of output 87 [2019-02-25 15:55:17,355 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:17,394 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:55:17,395 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:55:17,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:17,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:17,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:17,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:17,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:17,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:17,422 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:17,431 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 2 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:55:17,432 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:17,562 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:55:17,563 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:106 [2019-02-25 15:55:17,602 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:55:17,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:17,622 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:55:17,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:17,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:55:17,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:17,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:17,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:17,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:17,642 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-02-25 15:55:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:20,713 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-02-25 15:55:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:55:20,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:55:20,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:20,720 INFO L225 Difference]: With dead ends: 1306 [2019-02-25 15:55:20,721 INFO L226 Difference]: Without dead ends: 1305 [2019-02-25 15:55:20,721 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:55:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-02-25 15:55:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-02-25 15:55:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-25 15:55:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-25 15:55:21,377 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-25 15:55:21,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:21,377 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-25 15:55:21,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:21,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-25 15:55:21,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:21,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:21,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:21,380 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:21,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:21,380 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-02-25 15:55:21,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:21,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:21,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:21,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:21,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:21,547 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-02-25 15:55:21,599 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:55:21,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:21,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:21,599 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:21,600 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-02-25 15:55:21,601 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:21,601 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:21,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:21,977 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:55:21,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:21,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:21,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:21,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:21,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:21,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:21,994 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:55:21,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:22,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:55:22,052 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,073 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,083 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,103 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,125 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,155 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,191 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:55:22,194 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 24 treesize of output 30 [2019-02-25 15:55:22,197 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 26 treesize of output 40 [2019-02-25 15:55:22,214 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 28 treesize of output 54 [2019-02-25 15:55:22,216 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 30 treesize of output 72 [2019-02-25 15:55:22,218 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:55:22,219 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,256 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,277 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,293 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,306 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,319 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,365 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:22,365 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:55:22,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,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, 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:55:22,429 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,472 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:55:22,473 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:22,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,517 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:22,518 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:55:22,519 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,563 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:55:22,564 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:61 [2019-02-25 15:55:22,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,600 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,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, 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:55:22,605 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,648 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:55:22,648 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-02-25 15:55:22,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:22,692 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:22,693 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:55:22,693 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:22,734 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:55:22,735 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:51 [2019-02-25 15:55:22,765 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:55:22,765 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:22,827 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:55:22,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:22,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:55:22,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:22,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:55:22,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:55:22,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:55:22,847 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-02-25 15:55:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:24,395 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-02-25 15:55:24,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:24,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:55:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:24,400 INFO L225 Difference]: With dead ends: 1360 [2019-02-25 15:55:24,401 INFO L226 Difference]: Without dead ends: 1358 [2019-02-25 15:55:24,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:55:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-02-25 15:55:25,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-02-25 15:55:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-02-25 15:55:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-02-25 15:55:25,080 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-02-25 15:55:25,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:25,080 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-02-25 15:55:25,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:55:25,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-02-25 15:55:25,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:25,083 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:25,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:25,083 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:25,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:25,083 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-02-25 15:55:25,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:25,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:25,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:25,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:25,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:25,181 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:55:25,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:25,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:25,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:25,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:25,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:25,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:55:25,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:25,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:25,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:55:25,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:25,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:55:25,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:25,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:55:25,240 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,257 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,269 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,289 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,313 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,344 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,381 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 21 treesize of output 24 [2019-02-25 15:55:25,384 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 24 treesize of output 30 [2019-02-25 15:55:25,386 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 26 treesize of output 40 [2019-02-25 15:55:25,388 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 28 treesize of output 54 [2019-02-25 15:55:25,392 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 30 treesize of output 72 [2019-02-25 15:55:25,396 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:55:25,396 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,435 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,455 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,471 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,484 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,497 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,546 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:55:25,547 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-25 15:55:25,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,576 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:55:25,577 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,665 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:55:25,665 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:25,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,691 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,695 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:55:25,695 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,737 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:55:25,737 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:25,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,761 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,762 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,763 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,765 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,766 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,767 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,768 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,769 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:25,769 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:25,770 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:55:25,771 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:25,812 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:55:25,812 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-25 15:55:25,834 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:55:25,834 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:25,863 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:55:25,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:25,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:55:25,883 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:25,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:25,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:25,884 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-02-25 15:55:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:27,588 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-02-25 15:55:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:27,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:55:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:27,595 INFO L225 Difference]: With dead ends: 1898 [2019-02-25 15:55:27,595 INFO L226 Difference]: Without dead ends: 1896 [2019-02-25 15:55:27,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:55:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-25 15:55:28,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-02-25 15:55:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-02-25 15:55:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-02-25 15:55:28,574 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-02-25 15:55:28,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:28,575 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-02-25 15:55:28,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:28,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-02-25 15:55:28,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:28,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:28,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:28,579 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:28,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:28,580 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-02-25 15:55:28,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:28,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:28,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:28,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:28,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:28,685 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:55:28,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:55:28,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-25 15:55:28,685 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:55:28,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:55:28,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:55:28,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-25 15:55:28,686 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-02-25 15:55:29,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:29,768 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-02-25 15:55:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:55:29,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-25 15:55:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:29,773 INFO L225 Difference]: With dead ends: 1693 [2019-02-25 15:55:29,773 INFO L226 Difference]: Without dead ends: 1692 [2019-02-25 15:55:29,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:55:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-02-25 15:55:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-02-25 15:55:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-02-25 15:55:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-02-25 15:55:30,760 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-02-25 15:55:30,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:30,760 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-02-25 15:55:30,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:55:30,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-02-25 15:55:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:30,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:30,763 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:30,763 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:30,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-02-25 15:55:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:30,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:30,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:30,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:30,956 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-02-25 15:55:30,968 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:55:30,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:30,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:30,969 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:30,969 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-02-25 15:55:30,970 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:30,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:31,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:31,206 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:55:31,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:31,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:31,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:31,206 INFO 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:55:31,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:31,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:31,220 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:55:31,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:31,235 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 21 treesize of output 24 [2019-02-25 15:55:31,241 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:55:31,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,252 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:55:31,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,264 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,266 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,266 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:55:31,271 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,281 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,281 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:55:31,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,287 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,291 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:55:31,292 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,334 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,357 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,374 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,391 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,405 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,452 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:55:31,453 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,465 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,478 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,499 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,526 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,571 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:55:31,571 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-25 15:55:31,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,594 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 41 treesize of output 87 [2019-02-25 15:55:31,595 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,638 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:55:31,638 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:55:31,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,664 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:31,669 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:55:31,669 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:31,714 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:55:31,714 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-02-25 15:55:31,735 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:55:31,735 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:31,748 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:55:31,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:31,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:55:31,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:31,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:55:31,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:55:31,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:55:31,767 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-02-25 15:55:33,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:33,798 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-02-25 15:55:33,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:33,798 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-25 15:55:33,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:33,806 INFO L225 Difference]: With dead ends: 2759 [2019-02-25 15:55:33,806 INFO L226 Difference]: Without dead ends: 2757 [2019-02-25 15:55:33,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:55:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-02-25 15:55:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-02-25 15:55:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-02-25 15:55:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-02-25 15:55:35,492 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-02-25 15:55:35,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:35,492 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-02-25 15:55:35,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:55:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-02-25 15:55:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:35,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:35,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:35,497 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:35,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:35,497 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-02-25 15:55:35,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:35,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:35,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:35,622 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:55:35,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:35,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:35,622 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:55:35,623 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-02-25 15:55:35,624 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:35,624 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:35,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:35,960 INFO L272 AbstractInterpreter]: Visited 6 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:55:35,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:35,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:35,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:35,960 INFO 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:55:35,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:35,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:35,973 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:55:35,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:35,977 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:55:35,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,982 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 24 treesize of output 30 [2019-02-25 15:55:35,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:35,992 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 26 treesize of output 40 [2019-02-25 15:55:36,000 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,002 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,004 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,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 28 treesize of output 54 [2019-02-25 15:55:36,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,021 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 30 treesize of output 72 [2019-02-25 15:55:36,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,037 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:55:36,038 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,081 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,105 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,124 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,138 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,152 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,209 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:55:36,209 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,225 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,242 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,265 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,290 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,319 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,366 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:55:36,366 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:55:36,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,407 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:55:36,407 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,451 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:55:36,451 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:36,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,485 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,489 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:36,490 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:55:36,491 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,534 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:55:36,534 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-25 15:55:36,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,564 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,565 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,566 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,568 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,574 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:55:36,575 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,617 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:55:36,617 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-25 15:55:36,647 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,654 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,655 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:36,657 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:36,658 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:55:36,658 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:36,699 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:55:36,699 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:55:36,724 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:55:36,724 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:36,771 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:55:36,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:36,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:55:36,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:36,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:55:36,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:55:36,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:36,790 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-02-25 15:55:40,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:40,262 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-02-25 15:55:40,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:55:40,263 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-25 15:55:40,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:40,274 INFO L225 Difference]: With dead ends: 3636 [2019-02-25 15:55:40,274 INFO L226 Difference]: Without dead ends: 3626 [2019-02-25 15:55:40,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-25 15:55:40,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-02-25 15:55:42,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-02-25 15:55:42,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-02-25 15:55:42,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-02-25 15:55:42,702 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-02-25 15:55:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:42,702 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-02-25 15:55:42,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:55:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-02-25 15:55:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:55:42,707 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:42,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-25 15:55:42,707 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:42,707 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-02-25 15:55:42,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:42,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:42,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:42,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:42,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:42,770 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:55:42,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:42,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:42,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:55:42,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:55:42,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:42,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55:42,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:55:42,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:55:42,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:55:42,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:55:42,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:55:42,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:42,806 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:55:42,809 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:55:42,812 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,813 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:55:42,821 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:55:42,827 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,829 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,831 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,833 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:55:42,836 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,837 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,840 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:42,843 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:55:42,843 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,883 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,902 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,920 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,934 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,947 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:42,995 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:55:42,995 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,007 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,024 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,045 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,072 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,117 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:55:43,118 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:55:43,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,144 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 41 treesize of output 87 [2019-02-25 15:55:43,145 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,185 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:55:43,185 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:55:43,206 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,207 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,209 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,210 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,211 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,213 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,214 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,223 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:55:43,224 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:55:43,355 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:55:43,356 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-02-25 15:55:43,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:43,453 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:43,454 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:55:43,455 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:43,486 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:55:43,486 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-02-25 15:55:43,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:55:43,503 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:43,527 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:55:43,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:43,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:55:43,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:43,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:55:43,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:55:43,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:55:43,547 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-02-25 15:55:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:47,542 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-02-25 15:55:47,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:55:47,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-25 15:55:47,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:47,556 INFO L225 Difference]: With dead ends: 4300 [2019-02-25 15:55:47,556 INFO L226 Difference]: Without dead ends: 4298 [2019-02-25 15:55:47,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-25 15:55:47,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-02-25 15:55:51,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-02-25 15:55:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-02-25 15:55:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-02-25 15:55:51,171 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-02-25 15:55:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:55:51,171 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-02-25 15:55:51,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:55:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-02-25 15:55:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:55:51,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:55:51,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:55:51,177 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:55:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:51,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-02-25 15:55:51,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:55:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:51,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:55:51,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:55:51,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:55:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:51,332 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:55:51,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:51,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:55:51,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:55:51,332 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-02-25 15:55:51,333 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:55:51,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:55:51,673 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:55:51,674 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:55:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:55:51,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:55:51,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:55:51,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55:51,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:55:51,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:55:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:55:51,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:55:51,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:55:51,692 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 21 treesize of output 24 [2019-02-25 15:55:51,696 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,696 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 24 treesize of output 30 [2019-02-25 15:55:51,705 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,707 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,707 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 26 treesize of output 40 [2019-02-25 15:55:51,711 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,716 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,716 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 28 treesize of output 54 [2019-02-25 15:55:51,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,723 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,725 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,726 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 30 treesize of output 72 [2019-02-25 15:55:51,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:51,742 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:55:51,743 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,792 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,816 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,835 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,851 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,865 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,918 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:55:51,919 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,933 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,940 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,956 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:51,977 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,006 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,053 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:55:52,053 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:55:52,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,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, 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:55:52,096 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,141 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:55:52,141 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:55:52,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,185 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:55:52,186 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,414 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:55:52,415 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:55:52,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,456 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,458 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,458 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:52,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, 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:55:52,460 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,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:55:52,502 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:55:52,532 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,533 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,534 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,543 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:55:52,544 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:55:52,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, 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:55:52,546 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:55:52,587 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:55:52,588 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:45 [2019-02-25 15:55:52,617 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:55:52,617 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:55:52,675 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:55:52,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:55:52,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-25 15:55:52,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:55:52,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:55:52,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:55:52,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:55:52,693 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-02-25 15:55:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:55:56,942 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-02-25 15:55:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:55:56,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:55:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:55:56,956 INFO L225 Difference]: With dead ends: 4236 [2019-02-25 15:55:56,956 INFO L226 Difference]: Without dead ends: 4233 [2019-02-25 15:55:56,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:55:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-02-25 15:56:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-02-25 15:56:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-02-25 15:56:00,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-02-25 15:56:00,614 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-02-25 15:56:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:00,614 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-02-25 15:56:00,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:56:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-02-25 15:56:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:56:00,620 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:00,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:00,621 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-02-25 15:56:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:00,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:00,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:00,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:00,715 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:56:00,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:00,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:00,716 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:56:00,716 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-02-25 15:56:00,716 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:00,716 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:01,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:01,040 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:56:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:01,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:01,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:01,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:56:01,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:01,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:01,053 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:56:01,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:01,086 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 15:56:01,087 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,108 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,122 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,138 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,157 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,180 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:56:01,183 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 24 treesize of output 30 [2019-02-25 15:56:01,186 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:56:01,187 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-02-25 15:56:01,190 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 30 treesize of output 72 [2019-02-25 15:56:01,197 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 15:56:01,197 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,223 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,243 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,260 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,273 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,285 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,319 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:01,319 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-25 15:56:01,388 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,388 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:56:01,389 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,418 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:01,418 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:56:01,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,453 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:01,454 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,483 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:56:01,483 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:56:01,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,511 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,512 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,513 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,514 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,515 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,517 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,517 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:01,518 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:01,519 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,544 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:56:01,545 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:56:01,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,573 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:01,580 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:01,580 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:01,581 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:01,608 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:56:01,608 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 15:56:01,635 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:56:01,635 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:01,700 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:56:01,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:01,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:56:01,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:01,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:56:01,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:56:01,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:56:01,720 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-02-25 15:56:05,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:05,912 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-02-25 15:56:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:56:05,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:56:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:05,925 INFO L225 Difference]: With dead ends: 4232 [2019-02-25 15:56:05,925 INFO L226 Difference]: Without dead ends: 4231 [2019-02-25 15:56:05,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:56:05,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-02-25 15:56:09,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-02-25 15:56:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-02-25 15:56:09,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-02-25 15:56:09,559 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-02-25 15:56:09,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:09,560 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-02-25 15:56:09,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:56:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-02-25 15:56:09,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:56:09,565 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:09,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:09,566 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:09,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-02-25 15:56:09,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:09,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:09,641 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:56:09,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:09,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:09,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:56:09,642 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-02-25 15:56:09,643 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:09,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:09,920 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:09,920 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:56:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:09,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:09,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:09,921 INFO 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:56:09,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:09,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:09,934 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:56:09,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:09,992 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:56:09,993 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,012 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,034 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,064 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,099 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,137 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 21 treesize of output 24 [2019-02-25 15:56:10,140 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:56:10,144 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:56:10,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, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:56:10,152 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:56:10,155 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:56:10,156 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,191 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,210 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,224 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,236 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,248 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,292 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:56:10,292 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:56:10,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 15:56:10,331 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,372 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:56:10,373 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:56:10,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,423 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 15:56:10,424 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:56:10,557 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:56:10,557 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:110 [2019-02-25 15:56:10,665 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:10,671 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:10,672 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:10,673 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:10,705 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:56:10,705 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:36 [2019-02-25 15:56:10,729 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:56:10,729 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:10,763 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:56:10,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:10,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:56:10,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:10,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:56:10,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:56:10,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:56:10,782 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-02-25 15:56:11,014 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-25 15:56:15,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:15,095 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-02-25 15:56:15,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:56:15,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:56:15,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:15,110 INFO L225 Difference]: With dead ends: 4570 [2019-02-25 15:56:15,110 INFO L226 Difference]: Without dead ends: 4569 [2019-02-25 15:56:15,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:56:15,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-02-25 15:56:18,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-02-25 15:56:18,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-02-25 15:56:18,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-02-25 15:56:18,916 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-02-25 15:56:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:18,916 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-02-25 15:56:18,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:56:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-02-25 15:56:18,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:56:18,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:18,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:18,923 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:18,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:18,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-02-25 15:56:18,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:18,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:18,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:18,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:18,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:19,085 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 19 [2019-02-25 15:56:19,208 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:56:19,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:19,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:19,208 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:56:19,209 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-02-25 15:56:19,210 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:19,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:19,884 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:19,884 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:56:19,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:19,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:19,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:19,885 INFO 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:56:19,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:19,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:19,901 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:56:19,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:19,905 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 21 treesize of output 24 [2019-02-25 15:56:19,912 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,912 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 24 treesize of output 30 [2019-02-25 15:56:19,916 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 15:56:19,922 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,924 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,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 28 treesize of output 54 [2019-02-25 15:56:19,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,938 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 30 treesize of output 72 [2019-02-25 15:56:19,944 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,952 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,955 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:19,955 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:56:19,956 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,003 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,025 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,045 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,061 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,075 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,131 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:56:20,131 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,149 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,162 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,181 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,208 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,237 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,284 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:20,284 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:56:20,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,327 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:56:20,328 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,372 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:56:20,373 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:56:20,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,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, 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:56:20,413 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,458 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:56:20,458 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:56:20,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,509 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:20,510 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:56:20,510 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,551 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:56:20,551 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 15:56:20,584 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,585 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,586 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,587 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,598 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:20,598 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:20,599 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:56:20,600 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:20,643 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:56:20,643 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-25 15:56:20,676 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:56:20,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:20,765 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:56:20,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:20,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-25 15:56:20,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:20,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:56:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:56:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:56:20,786 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-02-25 15:56:26,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:26,771 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-02-25 15:56:26,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:56:26,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:56:26,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:26,790 INFO L225 Difference]: With dead ends: 5928 [2019-02-25 15:56:26,790 INFO L226 Difference]: Without dead ends: 5927 [2019-02-25 15:56:26,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-02-25 15:56:26,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-02-25 15:56:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-02-25 15:56:31,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-02-25 15:56:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-02-25 15:56:31,972 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-02-25 15:56:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:31,972 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-02-25 15:56:31,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:56:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-02-25 15:56:31,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:56:31,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:31,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:31,980 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:31,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:31,980 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-02-25 15:56:31,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:31,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:31,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:31,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:56:32,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:32,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:32,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:56:32,114 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-02-25 15:56:32,115 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:32,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:32,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:32,386 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:56:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:32,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:32,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:32,386 INFO 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:56:32,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:32,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:32,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:56:32,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:32,404 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 21 treesize of output 24 [2019-02-25 15:56:32,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:56:32,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:56:32,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,435 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:56:32,440 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:56:32,466 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:56:32,466 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,493 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,515 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,532 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,545 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,557 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,596 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:56:32,597 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,603 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,614 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,631 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,662 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:56:32,662 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-25 15:56:32,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,721 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-25 15:56:32,722 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:32,748 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:56:32,748 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-25 15:56:32,936 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-25 15:56:32,976 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:32,997 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,116 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,141 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,141 INFO L292 Elim1Store]: Index analysis took 201 ms [2019-02-25 15:56:33,149 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:33,150 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:56:33,231 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:56:33,232 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-25 15:56:33,273 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,274 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,275 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,276 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,277 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,278 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,279 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,280 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,280 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:33,281 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2019-02-25 15:56:33,282 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:33,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,336 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,338 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,339 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:33,340 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:33,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2019-02-25 15:56:33,341 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:33,378 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 15:56:33,378 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:72 [2019-02-25 15:56:33,439 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:56:33,439 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:33,472 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:56:33,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:33,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-25 15:56:33,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:33,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:56:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:56:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:56:33,493 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-02-25 15:56:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:40,229 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-02-25 15:56:40,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:56:40,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 15:56:40,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:40,253 INFO L225 Difference]: With dead ends: 6511 [2019-02-25 15:56:40,253 INFO L226 Difference]: Without dead ends: 6510 [2019-02-25 15:56:40,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:56:40,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-02-25 15:56:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-02-25 15:56:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-02-25 15:56:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-02-25 15:56:47,028 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-02-25 15:56:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:56:47,028 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-02-25 15:56:47,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:56:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-02-25 15:56:47,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:56:47,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:56:47,037 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:56:47,037 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:56:47,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:47,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-02-25 15:56:47,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:56:47,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:47,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:47,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:56:47,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:56:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:47,360 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:56:47,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:47,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:56:47,361 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:56:47,361 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-02-25 15:56:47,362 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:56:47,362 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:56:47,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:56:47,717 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:56:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:56:47,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:56:47,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:56:47,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:56:47,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:56:47,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:56:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:56:47,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:56:47,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:56:47,772 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:56:47,772 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,793 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,811 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,826 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,854 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,889 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:56:47,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:56:47,896 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:56:47,900 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:56:47,903 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:56:47,907 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:56:47,908 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,942 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,960 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,975 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,987 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:47,999 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:56:48,042 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:48,042 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-02-25 15:56:48,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:56:48,118 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:48,147 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:56:48,148 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-25 15:56:48,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,184 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,186 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,188 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:48,189 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:48,218 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:56:48,218 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-25 15:56:48,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,254 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,257 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:48,257 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 15:56:48,258 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:48,285 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:56:48,285 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-25 15:56:48,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,321 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,322 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,323 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:56:48,328 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:56:48,329 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 70 [2019-02-25 15:56:48,330 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:56:48,358 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:56:48,359 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-25 15:56:48,388 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:56:48,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:56:48,460 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:56:48,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:56:48,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 15:56:48,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:56:48,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:56:48,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:56:48,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:56:48,480 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-02-25 15:56:57,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:56:57,177 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-02-25 15:56:57,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:56:57,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 15:56:57,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:56:57,201 INFO L225 Difference]: With dead ends: 7179 [2019-02-25 15:56:57,201 INFO L226 Difference]: Without dead ends: 7170 [2019-02-25 15:56:57,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:56:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-02-25 15:57:03,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-02-25 15:57:03,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-02-25 15:57:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-02-25 15:57:03,979 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-02-25 15:57:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:03,979 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-02-25 15:57:03,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:57:03,979 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-02-25 15:57:03,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:57:03,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:03,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:03,986 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:03,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:03,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-02-25 15:57:03,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:03,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:03,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:03,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:03,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:04,047 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:57:04,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:04,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:04,048 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:57:04,048 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-02-25 15:57:04,049 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:57:04,049 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:57:04,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:57:04,252 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:57:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:04,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:57:04,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:04,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:57:04,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:04,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:04,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:57:04,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:04,294 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-25 15:57:04,295 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,311 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,330 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,351 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:57:04,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, 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 26 [2019-02-25 15:57:04,361 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 15:57:04,369 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:57:04,378 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-02-25 15:57:04,387 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:57:04,388 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,412 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,423 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,435 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,447 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,459 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,491 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:57:04,491 INFO L208 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-02-25 15:57:04,521 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:04,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, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-02-25 15:57:04,545 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-25 15:57:04,829 INFO L301 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-02-25 15:57:04,829 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:333 [2019-02-25 15:57:04,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:04,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:04,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:04,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 15:57:04,892 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:04,903 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:57:04,903 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-25 15:57:04,915 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:57:04,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:04,933 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:57:04,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:04,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-25 15:57:04,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:04,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:57:04,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:57:04,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:57:04,953 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-02-25 15:57:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:14,524 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-02-25 15:57:14,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:57:14,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 15:57:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:14,563 INFO L225 Difference]: With dead ends: 10441 [2019-02-25 15:57:14,563 INFO L226 Difference]: Without dead ends: 10440 [2019-02-25 15:57:14,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 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:57:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-02-25 15:57:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-02-25 15:57:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-02-25 15:57:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-02-25 15:57:24,917 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-02-25 15:57:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:24,918 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-02-25 15:57:24,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:57:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-02-25 15:57:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:57:24,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:24,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:24,928 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:24,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-02-25 15:57:24,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:24,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:24,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:24,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:24,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:25,096 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:57:25,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:25,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:25,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:57:25,097 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-02-25 15:57:25,098 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:57:25,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:57:25,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:57:25,379 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:57:25,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:25,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:57:25,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:25,380 INFO 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:57:25,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:25,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:25,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:57:25,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:25,398 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 21 treesize of output 24 [2019-02-25 15:57:25,401 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:57:25,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:57:25,422 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,427 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:57:25,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,438 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,441 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,441 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:57:25,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,454 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,457 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,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, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:57:25,458 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,498 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,518 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,534 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,545 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,557 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,605 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:57:25,606 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,616 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,626 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,644 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,671 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,715 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:57:25,716 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:57:25,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,747 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 41 treesize of output 87 [2019-02-25 15:57:25,747 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,788 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:57:25,789 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 15:57:25,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,817 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,820 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,821 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:25,822 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 43 treesize of output 89 [2019-02-25 15:57:25,823 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:25,863 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:57:25,864 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:57 [2019-02-25 15:57:25,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,894 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,895 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,896 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,897 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,898 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,900 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:25,902 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:25,911 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 2 case distinctions, treesize of input 45 treesize of output 95 [2019-02-25 15:57:25,912 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:57:26,038 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:57:26,038 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:106 [2019-02-25 15:57:26,084 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:57:26,084 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:26,124 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:57:26,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:26,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:57:26,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:26,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:57:26,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:57:26,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:57:26,143 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-02-25 15:57:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:35,969 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-02-25 15:57:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:57:35,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:57:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:36,009 INFO L225 Difference]: With dead ends: 10427 [2019-02-25 15:57:36,009 INFO L226 Difference]: Without dead ends: 10426 [2019-02-25 15:57:36,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:57:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-02-25 15:57:46,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-02-25 15:57:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-02-25 15:57:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-02-25 15:57:46,379 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-02-25 15:57:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:57:46,379 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-02-25 15:57:46,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:57:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-02-25 15:57:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:57:46,390 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:57:46,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:57:46,390 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:57:46,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:46,390 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-02-25 15:57:46,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:57:46,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:46,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:46,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:57:46,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:57:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:46,507 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:57:46,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:46,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:57:46,507 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:57:46,507 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-02-25 15:57:46,508 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:57:46,508 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:57:46,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:57:46,837 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:57:46,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:57:46,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:57:46,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:57:46,838 INFO 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:57:46,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:57:46,848 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:57:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:57:46,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:57:46,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:57:47,019 INFO L292 Elim1Store]: Index analysis took 163 ms [2019-02-25 15:57:47,019 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 21 treesize of output 24 [2019-02-25 15:57:47,022 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:57:47,025 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,027 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:57:47,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:57:47,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,044 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:57:47,055 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:57:47,055 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,084 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,105 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,120 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,134 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,147 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,190 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:57:47,190 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,196 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,207 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,223 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,254 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:47,255 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-25 15:57:47,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,305 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:57:47,305 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,323 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:47,323 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 15:57:47,347 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,350 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:47,350 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 15:57:47,351 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,369 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:57:47,369 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:31 [2019-02-25 15:57:47,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,392 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,395 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:57:47,395 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,413 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:57:47,413 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-25 15:57:47,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,508 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,509 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,510 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:57:47,510 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:57:47,510 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-25 15:57:47,511 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:57:47,528 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:57:47,528 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-25 15:57:47,548 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:57:47,548 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:57:47,601 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:57:47,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:57:47,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:57:47,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:57:47,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:57:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:57:47,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:57:47,622 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-02-25 15:57:58,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:57:58,257 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-02-25 15:57:58,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:57:58,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 15:57:58,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:57:58,298 INFO L225 Difference]: With dead ends: 11408 [2019-02-25 15:57:58,299 INFO L226 Difference]: Without dead ends: 11406 [2019-02-25 15:57:58,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:57:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-02-25 15:58:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-02-25 15:58:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-02-25 15:58:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-02-25 15:58:09,224 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-02-25 15:58:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:09,224 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-02-25 15:58:09,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:58:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-02-25 15:58:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:58:09,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:09,235 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:58:09,235 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:09,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:09,236 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-02-25 15:58:09,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:09,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:09,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:09,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 15:58:09,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:09,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:09,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:58:09,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:58:09,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:09,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:09,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:58:09,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:58:09,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:58:09,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:58:09,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:58:09,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:09,463 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 21 treesize of output 24 [2019-02-25 15:58:09,466 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,466 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 24 treesize of output 30 [2019-02-25 15:58:09,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,471 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,471 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 26 treesize of output 40 [2019-02-25 15:58:09,475 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,479 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,479 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 28 treesize of output 54 [2019-02-25 15:58:09,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,490 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 30 treesize of output 72 [2019-02-25 15:58:09,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,497 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,498 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,499 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:58:09,499 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,541 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,561 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,581 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,596 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,610 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,666 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:58:09,667 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,683 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,696 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,718 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,743 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,772 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,819 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:58:09,819 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 15:58:09,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,854 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:58:09,855 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,898 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:58:09,899 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:58:09,927 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,928 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,929 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,932 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:09,934 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:58:09,935 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:09,978 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:58:09,978 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-25 15:58:10,005 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,007 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,008 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,010 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,011 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,012 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,013 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,016 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,017 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:10,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, 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:58:10,018 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:10,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:58:10,061 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-02-25 15:58:10,084 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,086 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,087 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,088 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,091 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,092 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,097 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:10,098 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:58:10,099 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:10,140 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:58:10,140 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-02-25 15:58:10,166 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,169 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,170 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,171 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,179 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,180 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,181 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,182 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:10,183 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 45 treesize of output 93 [2019-02-25 15:58:10,184 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:10,226 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:58:10,227 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-02-25 15:58:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:10,253 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:58:10,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:10,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-25 15:58:10,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:10,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:58:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:58:10,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:58:10,347 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-02-25 15:58:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:24,607 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-02-25 15:58:24,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:58:24,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 15:58:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:24,664 INFO L225 Difference]: With dead ends: 14692 [2019-02-25 15:58:24,664 INFO L226 Difference]: Without dead ends: 14688 [2019-02-25 15:58:24,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:58:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-02-25 15:58:37,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-02-25 15:58:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-02-25 15:58:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-02-25 15:58:37,878 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-02-25 15:58:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:58:37,878 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-02-25 15:58:37,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:58:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-02-25 15:58:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:58:37,889 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:58:37,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:58:37,889 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:58:37,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:37,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-02-25 15:58:37,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:58:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:37,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:58:37,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:58:37,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:58:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:37,950 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:58:37,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:37,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:58:37,951 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:58:37,951 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-02-25 15:58:37,952 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:58:37,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:58:38,238 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:58:38,238 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:58:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:58:38,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:58:38,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:58:38,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:58:38,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:58:38,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:58:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:58:38,251 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:58:38,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:58:38,255 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 21 treesize of output 24 [2019-02-25 15:58:38,301 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:58:38,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,401 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:58:38,464 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,516 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,516 INFO L292 Elim1Store]: Index analysis took 113 ms [2019-02-25 15:58:38,517 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:58:38,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,622 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,648 INFO L292 Elim1Store]: Index analysis took 130 ms [2019-02-25 15:58:38,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:58:38,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,754 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:38,804 INFO L292 Elim1Store]: Index analysis took 153 ms [2019-02-25 15:58:38,804 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:58:38,805 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:38,968 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:38,990 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,008 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,022 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,035 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,087 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:58:39,088 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,098 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,109 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,130 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,156 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,200 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:58:39,201 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 15:58:39,231 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,232 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 41 treesize of output 87 [2019-02-25 15:58:39,233 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,274 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:58:39,274 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-25 15:58:39,300 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,302 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,303 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,304 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,305 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,308 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,309 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,310 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:58:39,311 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,349 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:58:39,349 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-25 15:58:39,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,372 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,374 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,376 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:58:39,382 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:58:39,383 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 89 [2019-02-25 15:58:39,384 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:58:39,423 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:58:39,424 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-25 15:58:39,445 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:58:39,446 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:58:39,501 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:58:39,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:58:39,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:58:39,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:58:39,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:58:39,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:58:39,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:58:39,521 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-02-25 15:58:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:58:51,782 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-02-25 15:58:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:58:51,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:58:51,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:58:51,832 INFO L225 Difference]: With dead ends: 13016 [2019-02-25 15:58:51,832 INFO L226 Difference]: Without dead ends: 13015 [2019-02-25 15:58:51,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:58:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-02-25 15:59:05,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-02-25 15:59:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-25 15:59:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-25 15:59:05,100 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-25 15:59:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:05,100 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-25 15:59:05,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:59:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-25 15:59:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:59:05,112 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:05,113 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 15:59:05,113 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:05,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:05,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-02-25 15:59:05,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:05,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:05,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:05,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:05,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:05,177 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:59:05,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:05,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:05,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:59:05,178 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-02-25 15:59:05,179 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:59:05,179 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:59:05,320 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:59:05,321 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:59:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:05,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:59:05,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:05,321 INFO 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:59:05,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:05,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:05,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:59:05,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:05,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 21 treesize of output 24 [2019-02-25 15:59:05,362 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:59:05,371 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,373 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:59:05,378 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,380 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,382 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,382 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:59:05,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,393 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:59:05,410 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 15:59:05,410 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,437 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,459 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,476 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,488 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,500 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,537 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 15:59:05,537 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,547 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,559 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,576 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,607 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:59:05,607 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-25 15:59:05,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,653 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:59:05,654 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:59:05,742 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:59:05,742 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-25 15:59:05,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,794 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:05,795 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 15:59:05,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:05,814 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:59:05,815 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2019-02-25 15:59:05,829 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:59:05,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:05,844 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:59:05,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:05,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-25 15:59:05,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:05,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:59:05,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:59:05,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:59:05,864 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-02-25 15:59:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:17,954 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-02-25 15:59:17,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:59:17,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-25 15:59:17,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:18,003 INFO L225 Difference]: With dead ends: 12974 [2019-02-25 15:59:18,003 INFO L226 Difference]: Without dead ends: 12973 [2019-02-25 15:59:18,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:59:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-02-25 15:59:31,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-02-25 15:59:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-25 15:59:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-25 15:59:31,272 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-25 15:59:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:31,272 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-25 15:59:31,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:59:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-25 15:59:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:59:31,283 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:31,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:59:31,283 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:31,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-02-25 15:59:31,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:31,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:31,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:31,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:31,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:31,390 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:59:31,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:31,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:31,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:59:31,391 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-02-25 15:59:31,392 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:59:31,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:59:31,671 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:59:31,671 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 15:59:31,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:31,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:59:31,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:31,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:31,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:31,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:31,684 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:59:31,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:31,688 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 15:59:31,693 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 15:59:31,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,701 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 15:59:31,710 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,712 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,714 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,715 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 15:59:31,722 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,726 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,728 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,732 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 15:59:31,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,749 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,751 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:31,752 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 15:59:31,752 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,794 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,814 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,832 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,845 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,858 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,905 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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:59:31,905 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,918 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,928 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,946 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:31,973 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:32,017 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:59:32,017 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 15:59:32,051 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,060 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 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 15:59:32,062 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 15:59:32,208 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:59:32,208 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:122 [2019-02-25 15:59:32,292 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,296 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,297 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:32,298 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:59:32,298 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:32,326 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:59:32,327 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 15:59:32,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,355 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,356 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:32,358 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 15:59:32,358 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:32,384 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:59:32,385 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-25 15:59:32,405 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:59:32,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:32,439 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:59:32,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:32,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 15:59:32,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:32,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:59:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:59:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-25 15:59:32,458 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-02-25 15:59:45,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:59:45,147 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-02-25 15:59:45,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:59:45,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 15:59:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:59:45,195 INFO L225 Difference]: With dead ends: 13106 [2019-02-25 15:59:45,195 INFO L226 Difference]: Without dead ends: 13105 [2019-02-25 15:59:45,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:59:45,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-02-25 15:59:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-02-25 15:59:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-02-25 15:59:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-02-25 15:59:58,357 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-02-25 15:59:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:59:58,357 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-02-25 15:59:58,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:59:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-02-25 15:59:58,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:59:58,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:59:58,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 15:59:58,368 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:59:58,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-02-25 15:59:58,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:59:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:59:58,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:59:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:58,474 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:59:58,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:58,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:59:58,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 15:59:58,474 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-02-25 15:59:58,475 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:59:58,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:59:59,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:59:59,000 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 15:59:59,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:59:59,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:59:59,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:59:59,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:59:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:59:59,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:59:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:59:59,013 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:59:59,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:59:59,016 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 21 treesize of output 24 [2019-02-25 15:59:59,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,023 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 24 treesize of output 30 [2019-02-25 15:59:59,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,029 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,029 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 26 treesize of output 40 [2019-02-25 15:59:59,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,039 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,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 28 treesize of output 54 [2019-02-25 15:59:59,064 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,065 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,067 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 30 treesize of output 72 [2019-02-25 15:59:59,070 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,071 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,073 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,074 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,075 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,076 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 15:59:59,077 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,120 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,143 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,162 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,176 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,190 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,246 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:59:59,246 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,261 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,272 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,290 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,313 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,342 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,389 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:59:59,389 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 15:59:59,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,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:59:59,437 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,482 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:59:59,483 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 15:59:59,518 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,520 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,524 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,525 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:59,525 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:59:59,526 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,567 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:59:59,567 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-25 15:59:59,599 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,601 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,602 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,603 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,604 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,606 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,610 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:59:59,611 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,653 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:59:59,654 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-25 15:59:59,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,685 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,688 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,689 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,690 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,693 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,695 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:59:59,695 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 15:59:59,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:59:59,697 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:59:59,736 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:59:59,736 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-25 15:59:59,769 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:59:59,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:59:59,831 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:59:59,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:59:59,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:59:59,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:59:59,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:59:59,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:59:59,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:59:59,850 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-02-25 16:00:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:13,050 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-02-25 16:00:13,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 16:00:13,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-25 16:00:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:13,101 INFO L225 Difference]: With dead ends: 13278 [2019-02-25 16:00:13,102 INFO L226 Difference]: Without dead ends: 13277 [2019-02-25 16:00:13,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-25 16:00:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-02-25 16:00:26,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-02-25 16:00:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-02-25 16:00:26,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-02-25 16:00:26,634 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-02-25 16:00:26,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:26,634 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-02-25 16:00:26,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 16:00:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-02-25 16:00:26,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:00:26,645 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:26,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:00:26,646 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:26,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:26,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-02-25 16:00:26,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:26,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:26,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:26,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:26,805 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 16:00:26,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:26,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:26,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:00:26,805 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-02-25 16:00:26,806 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:00:26,806 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:00:27,132 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:00:27,132 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-25 16:00:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:27,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:00:27,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:27,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:27,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:27,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:27,146 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 16:00:27,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:27,149 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 21 treesize of output 24 [2019-02-25 16:00:27,157 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,157 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-02-25 16:00:27,167 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,168 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,169 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 26 treesize of output 40 [2019-02-25 16:00:27,175 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,178 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 28 treesize of output 54 [2019-02-25 16:00:27,183 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,185 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,187 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,190 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 30 treesize of output 72 [2019-02-25 16:00:27,202 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 16:00:27,203 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,232 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,254 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,272 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,287 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,301 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,345 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 16:00:27,345 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,360 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,368 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,383 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,401 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,434 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 16:00:27,435 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 16:00:27,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,489 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:27,490 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,519 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 16:00:27,519 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-25 16:00:27,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,547 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,548 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,549 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,550 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,551 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:27,551 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:27,552 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,580 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 16:00:27,581 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 16:00:27,605 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,606 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,607 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,608 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,609 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,610 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,611 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,612 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:27,612 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,641 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 16:00:27,641 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-25 16:00:27,668 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,669 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,670 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,673 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:27,677 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:27,677 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 68 [2019-02-25 16:00:27,678 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:27,703 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 16:00:27,704 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-25 16:00:27,731 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 16:00:27,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:27,788 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 16:00:27,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:27,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-25 16:00:27,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:27,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 16:00:27,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 16:00:27,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 16:00:27,808 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-02-25 16:00:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:00:43,921 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-02-25 16:00:43,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 16:00:43,921 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 16:00:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:00:43,994 INFO L225 Difference]: With dead ends: 17581 [2019-02-25 16:00:43,994 INFO L226 Difference]: Without dead ends: 17580 [2019-02-25 16:00:43,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-02-25 16:00:44,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-02-25 16:00:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-02-25 16:00:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-25 16:00:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-25 16:00:54,595 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-25 16:00:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:00:54,595 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-25 16:00:54,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 16:00:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-25 16:00:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:00:54,604 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:00:54,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:00:54,604 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:00:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-02-25 16:00:54,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:00:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:54,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:00:54,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:00:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:54,673 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 16:00:54,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:54,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:00:54,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:00:54,674 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-02-25 16:00:54,675 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:00:54,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:00:54,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:00:54,876 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 16:00:54,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:00:54,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:00:54,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:00:54,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:00:54,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:00:54,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:00:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:00:54,890 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:00:54,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:00:54,893 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 21 treesize of output 24 [2019-02-25 16:00:54,898 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:00:54,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,906 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 16:00:54,915 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,918 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,920 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,920 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 16:00:54,926 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,930 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,931 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,934 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 16:00:54,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,945 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,947 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,949 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:54,949 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 16:00:54,950 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:54,990 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,010 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,027 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,039 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,053 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,101 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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 16:00:55,101 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,113 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,126 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,148 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,176 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,220 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 16:00:55,220 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 16:00:55,245 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:55,254 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 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 16:00:55,255 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:00:55,395 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 16:00:55,396 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-25 16:00:55,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:00:55,485 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:00:55,485 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:00:55,486 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:00:55,514 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 16:00:55,514 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-02-25 16:00:55,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 16:00:55,534 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:00:55,555 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 16:00:55,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:00:55,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 16:00:55,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:00:55,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 16:00:55,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 16:00:55,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-25 16:00:55,573 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-02-25 16:01:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:05,264 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-02-25 16:01:05,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 16:01:05,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 16:01:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:05,302 INFO L225 Difference]: With dead ends: 9947 [2019-02-25 16:01:05,302 INFO L226 Difference]: Without dead ends: 9946 [2019-02-25 16:01:05,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-25 16:01:05,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-02-25 16:01:15,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-02-25 16:01:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-25 16:01:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-25 16:01:15,897 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-25 16:01:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:15,897 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-25 16:01:15,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 16:01:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-25 16:01:15,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:01:15,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:01:15,905 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-25 16:01:15,905 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:01:15,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:15,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-02-25 16:01:15,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:01:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:15,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:01:15,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:15,906 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:01:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-25 16:01:15,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:15,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:01:15,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:01:15,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:01:15,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:15,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:01:15,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 16:01:15,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 16:01:16,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 16:01:16,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:01:16,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 16:01:16,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:01:16,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 16:01:16,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,014 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 24 treesize of output 30 [2019-02-25 16:01:16,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,020 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 26 treesize of output 40 [2019-02-25 16:01:16,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,026 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,028 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,029 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 28 treesize of output 54 [2019-02-25 16:01:16,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,035 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,036 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 16:01:16,045 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-02-25 16:01:16,046 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,075 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,098 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,116 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,131 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,145 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,188 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-25 16:01:16,188 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,199 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,208 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,219 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,237 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,271 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 16:01:16,271 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-25 16:01:16,368 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,378 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 75 [2019-02-25 16:01:16,379 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:01:16,484 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:16,484 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-02-25 16:01:16,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,592 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,594 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:16,594 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-02-25 16:01:16,595 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:16,663 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,666 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,667 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,676 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:16,709 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 8 case distinctions, treesize of input 65 treesize of output 95 [2019-02-25 16:01:16,711 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-25 16:01:17,013 INFO L301 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-02-25 16:01:17,013 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-02-25 16:01:17,165 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-02-25 16:01:17,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,172 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,173 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,174 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,176 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,177 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,178 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:17,179 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 16:01:17,179 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:17,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,311 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,312 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,313 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,315 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,316 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,317 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,318 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,319 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,320 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,321 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2019-02-25 16:01:17,321 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:17,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,444 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,447 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,452 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:17,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 72 [2019-02-25 16:01:17,454 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:17,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,572 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-02-25 16:01:17,572 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:17,658 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-25 16:01:17,658 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-02-25 16:01:17,744 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,745 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,746 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,747 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,748 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,749 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 66 [2019-02-25 16:01:17,749 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:17,854 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,856 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,858 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,862 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,863 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,864 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,865 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,866 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 66 [2019-02-25 16:01:17,867 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:17,978 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,979 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,980 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,982 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,983 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,984 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,985 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,990 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:17,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 76 [2019-02-25 16:01:17,991 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:18,095 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,099 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,105 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,108 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 68 [2019-02-25 16:01:18,109 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:18,199 INFO L301 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-25 16:01:18,199 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-02-25 16:01:18,284 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,286 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,288 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,289 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,290 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,291 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,293 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,294 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,295 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,295 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:18,296 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 70 [2019-02-25 16:01:18,297 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:18,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,415 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,418 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,420 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,421 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,422 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2019-02-25 16:01:18,423 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:18,535 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,541 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,544 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,545 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,546 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,547 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:18,547 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 72 [2019-02-25 16:01:18,548 INFO L301 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:18,643 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,649 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:18,649 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 68 [2019-02-25 16:01:18,650 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:18,728 INFO L301 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-02-25 16:01:18,729 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:143 [2019-02-25 16:01:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:18,826 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:01:18,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:01:18,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:01:18,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-25 16:01:18,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:01:18,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 16:01:18,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 16:01:18,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-02-25 16:01:18,999 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-02-25 16:01:19,193 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-02-25 16:01:19,466 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-02-25 16:01:19,770 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-02-25 16:01:20,328 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-02-25 16:01:21,006 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-02-25 16:01:22,475 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-02-25 16:01:34,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:34,387 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-02-25 16:01:34,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 16:01:34,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-25 16:01:34,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:34,431 INFO L225 Difference]: With dead ends: 12394 [2019-02-25 16:01:34,431 INFO L226 Difference]: Without dead ends: 12392 [2019-02-25 16:01:34,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-02-25 16:01:34,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-02-25 16:01:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-02-25 16:01:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-02-25 16:01:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-02-25 16:01:43,247 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-02-25 16:01:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:01:43,247 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-02-25 16:01:43,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 16:01:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-02-25 16:01:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:01:43,254 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:01:43,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:01:43,254 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:01:43,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:43,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-02-25 16:01:43,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:01:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:43,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:01:43,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:01:43,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:01:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:43,338 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 16:01:43,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:43,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:01:43,339 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:01:43,339 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-02-25 16:01:43,340 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:01:43,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:01:43,759 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:01:43,759 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 16:01:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:01:43,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:01:43,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:01:43,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:01:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:01:43,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:01:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:01:43,772 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 16:01:43,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:01:43,776 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 21 treesize of output 24 [2019-02-25 16:01:43,779 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:01:43,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 16:01:43,793 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,795 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,798 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 16:01:43,816 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,818 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,822 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,823 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,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, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 16:01:43,826 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,828 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,830 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,832 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,833 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:43,834 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 16:01:43,834 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:43,874 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:43,896 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:43,913 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:43,927 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:43,940 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:43,991 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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 16:01:43,991 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,005 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,018 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,038 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,063 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,107 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 16:01:44,107 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 16:01:44,143 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,151 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 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 16:01:44,152 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:01:44,292 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 16:01:44,293 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:122 [2019-02-25 16:01:44,348 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,349 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,350 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,351 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,352 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,353 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,354 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,355 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 81 treesize of output 115 [2019-02-25 16:01:44,356 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,450 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,451 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,452 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2019-02-25 16:01:44,453 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,511 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:44,512 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:142, output treesize:94 [2019-02-25 16:01:44,555 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,556 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,557 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,558 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,559 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,560 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,561 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,562 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:44,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2019-02-25 16:01:44,563 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,632 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,633 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,634 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,636 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,637 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,638 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,639 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,640 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:01:44,641 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:01:44,642 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 109 [2019-02-25 16:01:44,642 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 16:01:44,719 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-02-25 16:01:44,720 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:102 [2019-02-25 16:01:45,456 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 16:01:45,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:01:45,493 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 16:01:45,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:01:45,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 16:01:45,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:01:45,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 16:01:45,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 16:01:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-02-25 16:01:45,512 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-02-25 16:01:45,700 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-02-25 16:01:47,273 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 82 [2019-02-25 16:01:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:01:55,026 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-02-25 16:01:55,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 16:01:55,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 16:01:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:01:55,052 INFO L225 Difference]: With dead ends: 7367 [2019-02-25 16:01:55,052 INFO L226 Difference]: Without dead ends: 7366 [2019-02-25 16:01:55,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-25 16:01:55,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-02-25 16:02:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-02-25 16:02:04,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-02-25 16:02:04,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-02-25 16:02:04,281 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-02-25 16:02:04,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:02:04,281 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-02-25 16:02:04,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 16:02:04,282 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-02-25 16:02:04,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:02:04,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:02:04,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:02:04,288 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:02:04,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-02-25 16:02:04,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:02:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:04,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:04,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:04,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:02:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:04,448 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 16:02:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:04,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:02:04,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 16:02:04,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 16:02:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:04,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:02:04,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 16:02:04,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 16:02:04,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 16:02:04,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 16:02:04,464 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 16:02:04,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:02:04,467 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 21 treesize of output 24 [2019-02-25 16:02:04,477 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,478 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 24 treesize of output 30 [2019-02-25 16:02:04,480 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,481 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,482 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 26 treesize of output 40 [2019-02-25 16:02:04,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,488 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 28 treesize of output 54 [2019-02-25 16:02:04,492 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,494 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,495 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,496 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,497 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 30 treesize of output 72 [2019-02-25 16:02:04,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,506 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,507 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,508 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 16:02:04,509 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,552 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,576 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,595 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,610 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,623 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,678 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 16:02:04,679 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,696 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,710 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,724 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,745 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,774 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,821 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 16:02:04,821 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-25 16:02:04,857 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,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 16:02:04,858 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,904 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 16:02:04,904 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-25 16:02:04,933 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,934 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,935 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,936 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,937 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,938 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:04,939 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 16:02:04,939 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:04,984 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 16:02:04,984 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-25 16:02:05,014 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,015 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,017 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,018 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,021 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,023 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,024 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,024 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:05,025 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 16:02:05,026 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:05,066 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 16:02:05,067 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-25 16:02:05,094 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,096 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,100 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,101 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,102 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,103 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,104 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,106 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,107 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:05,109 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:05,109 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 16:02:05,110 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:05,149 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 16:02:05,149 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-25 16:02:05,174 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 16:02:05,174 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:02:05,222 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 16:02:05,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:02:05,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-25 16:02:05,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:02:05,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 16:02:05,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 16:02:05,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-25 16:02:05,241 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-02-25 16:02:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:02:20,987 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-02-25 16:02:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 16:02:20,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 16:02:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:02:21,021 INFO L225 Difference]: With dead ends: 9936 [2019-02-25 16:02:21,021 INFO L226 Difference]: Without dead ends: 9935 [2019-02-25 16:02:21,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-02-25 16:02:21,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-02-25 16:02:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-02-25 16:02:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-02-25 16:02:34,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-02-25 16:02:34,771 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-02-25 16:02:34,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:02:34,771 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-02-25 16:02:34,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 16:02:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-02-25 16:02:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:02:34,779 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:02:34,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:02:34,779 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:02:34,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-02-25 16:02:34,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:02:34,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:34,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 16:02:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:02:34,780 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:02:34,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:34,887 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 16:02:34,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:34,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:02:34,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:02:34,888 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-02-25 16:02:34,889 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:02:34,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:02:35,170 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:02:35,170 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 16:02:35,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:02:35,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:02:35,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:02:35,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:02:35,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:02:35,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:02:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:02:35,183 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 16:02:35,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:02:35,223 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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 16:02:35,223 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,238 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,251 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,275 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,303 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,336 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 21 treesize of output 24 [2019-02-25 16:02:35,340 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:02:35,346 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 16:02:35,349 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 16:02:35,352 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 16:02:35,357 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 16:02:35,358 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,391 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,410 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,425 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,437 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,449 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,492 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 16:02:35,493 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-25 16:02:35,523 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,532 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 2 case distinctions, treesize of input 41 treesize of output 91 [2019-02-25 16:02:35,533 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:02:35,669 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 16:02:35,669 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:122 [2019-02-25 16:02:35,717 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,718 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,719 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,720 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,721 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,721 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:02:35,722 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:02:35,722 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,761 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 16:02:35,761 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-25 16:02:35,781 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,782 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,783 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,788 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:02:35,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:02:35,789 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:02:35,823 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 16:02:35,823 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-25 16:02:35,846 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 16:02:35,846 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:02:35,870 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 16:02:35,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:02:35,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-25 16:02:35,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:02:35,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 16:02:35,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 16:02:35,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-25 16:02:35,889 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-02-25 16:02:50,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:02:50,103 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-02-25 16:02:50,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 16:02:50,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 16:02:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:02:50,136 INFO L225 Difference]: With dead ends: 9235 [2019-02-25 16:02:50,136 INFO L226 Difference]: Without dead ends: 9232 [2019-02-25 16:02:50,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-25 16:02:50,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-02-25 16:03:05,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-02-25 16:03:05,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-02-25 16:03:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-02-25 16:03:05,600 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-02-25 16:03:05,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:03:05,600 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-02-25 16:03:05,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 16:03:05,600 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-02-25 16:03:05,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:03:05,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:03:05,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:03:05,608 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:03:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:03:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-02-25 16:03:05,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:03:05,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:03:05,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:03:05,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:03:05,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:03:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:03:05,693 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 16:03:05,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:03:05,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:03:05,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:03:05,694 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-02-25 16:03:05,695 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:03:05,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:03:05,898 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:03:05,898 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 16:03:05,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:03:05,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:03:05,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:03:05,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:03:05,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:03:05,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:03:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:03:05,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 16:03:05,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:03:05,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:03:05,953 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:05,960 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:05,969 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:05,986 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,009 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 16:03:06,013 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:03:06,016 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 16:03:06,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 16:03:06,024 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 16:03:06,033 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 16:03:06,034 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,057 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,076 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,091 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,103 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,113 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,144 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 16:03:06,144 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 16:03:06,189 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:06,197 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 66 [2019-02-25 16:03:06,198 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:03:06,288 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 16:03:06,288 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-25 16:03:06,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:06,332 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:03:06,333 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 16:03:06,333 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:06,353 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 16:03:06,353 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-02-25 16:03:06,372 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 16:03:06,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:03:06,394 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 16:03:06,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:03:06,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 16:03:06,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:03:06,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 16:03:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 16:03:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-25 16:03:06,414 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-02-25 16:03:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:03:19,944 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-02-25 16:03:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 16:03:19,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-25 16:03:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:03:19,975 INFO L225 Difference]: With dead ends: 9065 [2019-02-25 16:03:19,975 INFO L226 Difference]: Without dead ends: 9064 [2019-02-25 16:03:19,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-25 16:03:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-02-25 16:03:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-02-25 16:03:34,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-02-25 16:03:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-02-25 16:03:34,514 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-02-25 16:03:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:03:34,514 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-02-25 16:03:34,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 16:03:34,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-02-25 16:03:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:03:34,522 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:03:34,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:03:34,522 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:03:34,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:03:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-02-25 16:03:34,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:03:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:03:34,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:03:34,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:03:34,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:03:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:03:34,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:03:34,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:03:34,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:03:34,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:03:34,606 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-02-25 16:03:34,607 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:03:34,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:03:35,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:03:35,007 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-25 16:03:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:03:35,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:03:35,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:03:35,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:03:35,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:03:35,016 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:03:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:03:35,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 16:03:35,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:03:35,066 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 16:03:35,067 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,084 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,092 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,107 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,128 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,162 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,202 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 21 treesize of output 24 [2019-02-25 16:03:35,204 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 24 treesize of output 30 [2019-02-25 16:03:35,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 26 treesize of output 40 [2019-02-25 16:03:35,209 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 28 treesize of output 54 [2019-02-25 16:03:35,211 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 30 treesize of output 72 [2019-02-25 16:03:35,214 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 16:03:35,215 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,250 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,271 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,286 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,299 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,311 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,357 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,357 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-02-25 16:03:35,411 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,411 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 16:03:35,412 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,454 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:03:35,455 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-02-25 16:03:35,499 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,500 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,501 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,502 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,503 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,504 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,505 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,506 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 16:03:35,506 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,549 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 16:03:35,549 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-02-25 16:03:35,588 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,589 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,590 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,591 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,593 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,594 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,595 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,596 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,597 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,598 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:03:35,599 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 16:03:35,599 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,641 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 16:03:35,641 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-02-25 16:03:35,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,679 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,682 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,683 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,684 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,686 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,687 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,687 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:03:35,688 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 16:03:35,689 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,730 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 16:03:35,730 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:51 [2019-02-25 16:03:35,796 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,797 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,798 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,799 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,800 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,803 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,804 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,805 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,806 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,807 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,808 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:03:35,809 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:03:35,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, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 97 [2019-02-25 16:03:35,810 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:03:35,852 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 16:03:35,852 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-02-25 16:03:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:03:36,061 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:03:36,158 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:03:36,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:03:36,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 16:03:36,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:03:36,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 16:03:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 16:03:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-02-25 16:03:36,177 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-02-25 16:03:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:03:53,964 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-02-25 16:03:53,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 16:03:53,964 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-25 16:03:53,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:03:53,995 INFO L225 Difference]: With dead ends: 9411 [2019-02-25 16:03:53,996 INFO L226 Difference]: Without dead ends: 9409 [2019-02-25 16:03:53,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-02-25 16:03:54,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-02-25 16:04:08,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-02-25 16:04:08,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-02-25 16:04:08,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-02-25 16:04:08,383 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-02-25 16:04:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:04:08,383 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-02-25 16:04:08,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 16:04:08,383 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-02-25 16:04:08,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:04:08,391 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:04:08,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:04:08,392 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:04:08,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:04:08,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-02-25 16:04:08,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:04:08,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:04:08,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:04:08,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:04:08,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:04:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:04:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:04:08,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:04:08,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:04:08,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:04:08,540 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-02-25 16:04:08,543 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:04:08,543 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:04:08,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:04:08,943 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-25 16:04:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:04:08,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:04:08,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:04:08,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:04:08,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:04:08,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:04:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:04:08,958 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 16:04:08,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:04:08,996 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 16:04:08,996 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,013 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,027 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,042 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,068 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,098 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,132 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 16:04:09,135 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 24 treesize of output 30 [2019-02-25 16:04:09,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-25 16:04:09,141 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 28 treesize of output 54 [2019-02-25 16:04:09,145 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-02-25 16:04:09,148 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-02-25 16:04:09,148 INFO L301 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,182 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,202 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,218 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,232 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,244 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,290 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:04:09,290 INFO L208 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-25 16:04:09,337 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,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, 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 16:04:09,339 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,444 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 16:04:09,445 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-25 16:04:09,483 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,484 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,486 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,487 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,489 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,490 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:04:09,490 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 16:04:09,491 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,532 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 16:04:09,532 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-02-25 16:04:09,569 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,570 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,571 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,572 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,574 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,575 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,576 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,577 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,578 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,579 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,580 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 16:04:09,581 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,623 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 16:04:09,624 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-02-25 16:04:09,650 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,651 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,652 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,653 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,655 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,656 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,657 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,658 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,659 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,660 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,661 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,662 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,663 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:04:09,663 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 16:04:09,664 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,702 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 16:04:09,702 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-02-25 16:04:09,729 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,730 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,731 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,732 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,733 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,734 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,736 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,737 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,738 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,739 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,740 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,742 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:09,742 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:04:09,743 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 16:04:09,744 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:09,784 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 16:04:09,785 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:51 [2019-02-25 16:04:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:04:09,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:04:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 16:04:09,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:04:09,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 16:04:09,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:04:09,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 16:04:09,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 16:04:09,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-25 16:04:09,918 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-02-25 16:04:25,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:04:25,595 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-02-25 16:04:25,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 16:04:25,596 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-25 16:04:25,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:04:25,624 INFO L225 Difference]: With dead ends: 8797 [2019-02-25 16:04:25,625 INFO L226 Difference]: Without dead ends: 8791 [2019-02-25 16:04:25,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-02-25 16:04:25,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-02-25 16:04:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-02-25 16:04:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-02-25 16:04:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-02-25 16:04:33,436 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-02-25 16:04:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:04:33,437 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-02-25 16:04:33,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 16:04:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-02-25 16:04:33,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:04:33,440 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:04:33,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:04:33,440 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:04:33,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:04:33,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-02-25 16:04:33,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:04:33,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:04:33,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:04:33,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:04:33,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:04:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:04:33,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 16:04:33,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:04:33,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:04:33,502 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:04:33,502 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-02-25 16:04:33,503 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:04:33,503 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:04:33,781 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:04:33,781 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 16:04:33,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:04:33,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:04:33,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:04:33,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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:04:33,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:04:33,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:04:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:04:33,794 WARN L254 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 16:04:33,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:04:33,882 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 14 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 16:04:33,882 INFO L301 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:33,896 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:33,910 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:33,931 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:33,959 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:33,993 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 21 treesize of output 24 [2019-02-25 16:04:33,997 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:04:34,002 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 16:04:34,005 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 16:04:34,008 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 16:04:34,011 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-02-25 16:04:34,012 INFO L301 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,045 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,064 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,079 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,091 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,103 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,146 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 16:04:34,147 INFO L208 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-25 16:04:34,178 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,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 41 treesize of output 87 [2019-02-25 16:04:34,179 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,220 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 16:04:34,220 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-25 16:04:34,248 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,249 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,250 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,251 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,252 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,256 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,256 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 87 [2019-02-25 16:04:34,257 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:34,297 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 16:04:34,297 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-25 16:04:34,324 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,325 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,326 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,327 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,328 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,329 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,330 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,332 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,334 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,335 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:34,335 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:04:34,344 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 93 [2019-02-25 16:04:34,345 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-25 16:04:34,467 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 16:04:34,468 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:94 [2019-02-25 16:04:34,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 16:04:34,514 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:04:34,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 16:04:34,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:04:34,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 16:04:34,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:04:34,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 16:04:34,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 16:04:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-25 16:04:34,571 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-02-25 16:04:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:04:44,251 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-02-25 16:04:44,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 16:04:44,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-25 16:04:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:04:44,257 INFO L225 Difference]: With dead ends: 1963 [2019-02-25 16:04:44,257 INFO L226 Difference]: Without dead ends: 1962 [2019-02-25 16:04:44,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 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 16:04:44,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-02-25 16:04:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-02-25 16:04:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-02-25 16:04:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-02-25 16:04:52,125 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-02-25 16:04:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:04:52,125 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-02-25 16:04:52,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 16:04:52,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-02-25 16:04:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:04:52,129 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:04:52,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:04:52,130 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:04:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:04:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-02-25 16:04:52,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:04:52,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:04:52,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:04:52,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:04:52,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:04:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:04:52,228 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 16:04:52,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:04:52,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:04:52,228 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:04:52,228 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-02-25 16:04:52,229 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:04:52,229 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:04:52,490 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:04:52,491 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-25 16:04:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:04:52,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:04:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:04:52,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:04:52,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:04:52,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:04:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:04:52,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 16:04:52,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:04:52,510 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 21 treesize of output 24 [2019-02-25 16:04:52,516 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:04:52,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,522 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,523 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 16:04:52,528 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,529 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,531 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 16:04:52,536 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,538 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,539 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,540 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,541 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 16:04:52,553 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 16:04:52,553 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,581 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,602 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,619 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,632 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,645 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,684 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:04:52,684 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,693 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,706 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,722 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,753 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 16:04:52,753 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-25 16:04:52,801 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,802 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 16:04:52,802 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,820 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 16:04:52,820 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-25 16:04:52,841 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,842 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,844 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,845 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,846 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,846 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 16:04:52,847 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,864 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 16:04:52,864 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-25 16:04:52,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,887 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,889 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,891 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:04:52,892 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:04:52,893 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 47 [2019-02-25 16:04:52,893 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:04:52,908 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 16:04:52,909 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-25 16:04:52,929 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 16:04:52,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:04:52,974 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 16:04:52,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:04:52,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-02-25 16:04:52,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:04:52,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 16:04:52,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 16:04:52,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-25 16:04:52,994 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-02-25 16:05:00,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:05:00,767 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-02-25 16:05:00,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 16:05:00,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-25 16:05:00,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:05:00,773 INFO L225 Difference]: With dead ends: 2000 [2019-02-25 16:05:00,773 INFO L226 Difference]: Without dead ends: 1999 [2019-02-25 16:05:00,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-25 16:05:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-02-25 16:05:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1945. [2019-02-25 16:05:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-02-25 16:05:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 13387 transitions. [2019-02-25 16:05:08,717 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 13387 transitions. Word has length 7 [2019-02-25 16:05:08,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:05:08,717 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 13387 transitions. [2019-02-25 16:05:08,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 16:05:08,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 13387 transitions. [2019-02-25 16:05:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:05:08,720 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:05:08,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:05:08,720 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:05:08,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:05:08,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-02-25 16:05:08,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:05:08,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:05:08,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:05:08,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:05:08,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:05:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:05:08,751 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 16:05:08,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:05:08,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:05:08,751 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:05:08,751 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [30], [32], [34], [35] [2019-02-25 16:05:08,752 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:05:08,752 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:05:08,894 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:05:08,894 INFO L272 AbstractInterpreter]: Visited 7 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 16:05:08,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:05:08,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:05:08,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:05:08,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:05:08,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:05:08,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:05:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:05:08,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 16:05:08,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:05:08,914 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-25 16:05:08,918 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:05:08,926 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-25 16:05:08,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, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-02-25 16:05:08,953 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-02-25 16:05:08,968 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-25 16:05:08,969 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,139 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,208 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,218 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,229 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,241 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,250 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 16:05:09,250 INFO L208 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-02-25 16:05:09,255 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:09,256 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 16:05:09,256 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,257 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:09,257 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 16:05:09,260 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 16:05:09,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:05:09,264 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 16:05:09,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 16:05:09,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-25 16:05:09,283 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 16:05:09,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 16:05:09,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 16:05:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 16:05:09,284 INFO L87 Difference]: Start difference. First operand 1945 states and 13387 transitions. Second operand 4 states. [2019-02-25 16:05:20,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 16:05:20,356 INFO L93 Difference]: Finished difference Result 3175 states and 21705 transitions. [2019-02-25 16:05:20,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 16:05:20,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-25 16:05:20,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 16:05:20,366 INFO L225 Difference]: With dead ends: 3175 [2019-02-25 16:05:20,366 INFO L226 Difference]: Without dead ends: 3170 [2019-02-25 16:05:20,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 16:05:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-02-25 16:05:32,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3133. [2019-02-25 16:05:32,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-02-25 16:05:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-02-25 16:05:32,491 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-02-25 16:05:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 16:05:32,491 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-02-25 16:05:32,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 16:05:32,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-02-25 16:05:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 16:05:32,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 16:05:32,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-25 16:05:32,496 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-25 16:05:32,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:05:32,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-02-25 16:05:32,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 16:05:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:05:32,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:05:32,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 16:05:32,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 16:05:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:05:32,547 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 16:05:32,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:05:32,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 16:05:32,547 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-25 16:05:32,547 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [30], [32], [33] [2019-02-25 16:05:32,548 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 16:05:32,548 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 16:05:32,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 16:05:32,836 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 16:05:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 16:05:32,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 16:05:32,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 16:05:32,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 16:05:32,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 16:05:32,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 16:05:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 16:05:32,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 16:05:32,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 16:05:32,853 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 21 treesize of output 24 [2019-02-25 16:05:32,856 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-02-25 16:05:32,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,860 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,861 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-25 16:05:32,866 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,867 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,868 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,869 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-25 16:05:32,873 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,875 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,876 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,878 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:32,878 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-02-25 16:05:32,890 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-02-25 16:05:32,891 INFO L301 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-25 16:05:32,918 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:32,940 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:32,957 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:32,970 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:32,983 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:33,020 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-25 16:05:33,020 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-25 16:05:33,028 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:33,037 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:33,053 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 16:05:33,084 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 16:05:33,084 INFO L208 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-25 16:05:33,122 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:33,123 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 16:05:33,123 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:05:33,141 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 16:05:33,141 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-25 16:05:33,160 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:33,161 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:33,162 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:33,163 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 16:05:33,163 INFO L158 IndexEqualityManager]: detected equality via solver [2019-02-25 16:05:33,164 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-25 16:05:33,164 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 16:05:33,182 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 16:05:33,182 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-25 16:05:33,198 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 16:05:33,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 16:05:33,218 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 16:05:33,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 16:05:33,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 16:05:33,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 16:05:33,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 16:05:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 16:05:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-25 16:05:33,237 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states.