java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:57:27,821 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:57:27,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:57:27,838 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:57:27,838 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:57:27,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:57:27,843 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:57:27,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:57:27,848 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:57:27,849 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:57:27,858 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:57:27,858 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:57:27,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:57:27,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:57:27,864 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:57:27,865 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:57:27,868 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:57:27,870 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:57:27,874 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:57:27,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:57:27,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:57:27,881 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:57:27,884 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:57:27,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:57:27,885 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:57:27,886 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:57:27,887 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:57:27,891 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:57:27,893 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:57:27,895 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:57:27,895 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:57:27,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:57:27,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:57:27,896 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:57:27,899 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:57:27,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:57:27,900 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:57:27,920 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:57:27,921 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:57:27,922 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:57:27,923 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:57:27,923 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:57:27,923 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:57:27,923 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:57:27,924 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:57:27,924 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:57:27,924 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:57:27,924 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:57:27,924 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:57:27,924 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:57:27,925 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:57:27,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:57:27,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:57:27,926 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:57:27,926 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:57:27,926 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:57:27,927 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:57:27,927 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:57:27,927 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:57:27,927 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:57:27,927 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:57:27,928 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:57:27,929 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:57:27,929 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:57:27,930 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:57:27,930 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:57:27,930 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:57:27,930 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:57:27,930 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:57:27,931 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:57:27,931 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:57:27,931 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:57:27,931 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:57:27,931 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:57:27,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:57:27,932 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:57:27,932 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:57:27,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:57:27,995 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:57:28,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:57:28,002 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:57:28,003 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:57:28,004 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-15 10:57:28,004 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-02-15 10:57:28,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:57:28,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:57:28,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:57:28,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:57:28,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:57:28,069 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,086 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:57:28,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:57:28,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:57:28,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:57:28,134 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,134 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,136 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,137 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,143 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,154 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,156 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 15.02 10:57:28" (1/1) ... [2019-02-15 10:57:28,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:57:28,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:57:28,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:57:28,165 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:57:28,166 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 15.02 10:57:28" (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-15 10:57:28,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-15 10:57:28,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-15 10:57:28,502 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-15 10:57:28,503 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-15 10:57:28,504 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:57:28 BoogieIcfgContainer [2019-02-15 10:57:28,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:57:28,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:57:28,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:57:28,509 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:57:28,509 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 15.02 10:57:28" (1/2) ... [2019-02-15 10:57:28,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac7295b and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:57:28, skipping insertion in model container [2019-02-15 10:57:28,510 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 15.02 10:57:28" (2/2) ... [2019-02-15 10:57:28,512 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-02-15 10:57:28,522 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:57:28,530 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-15 10:57:28,548 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-15 10:57:28,580 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:57:28,581 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:57:28,581 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:57:28,581 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:57:28,581 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:57:28,582 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:57:28,582 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:57:28,582 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:57:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-15 10:57:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-15 10:57:28,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:28,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-15 10:57:28,616 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:28,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:28,625 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-15 10:57:28,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:28,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:28,831 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-15 10:57:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:57:28,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:57:28,835 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:28,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:57:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:57:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:57:28,884 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-15 10:57:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:29,111 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-15 10:57:29,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:57:29,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-15 10:57:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:29,129 INFO L225 Difference]: With dead ends: 29 [2019-02-15 10:57:29,129 INFO L226 Difference]: Without dead ends: 24 [2019-02-15 10:57:29,133 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-15 10:57:29,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-15 10:57:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-15 10:57:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-15 10:57:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-15 10:57:29,183 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-15 10:57:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:29,184 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-15 10:57:29,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:57:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-15 10:57:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:29,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:29,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:29,189 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:29,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:29,189 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-15 10:57:29,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:29,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:29,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:29,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:29,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:29,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:29,321 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:29,323 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-15 10:57:29,359 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:29,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:29,425 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:29,427 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:29,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:29,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:29,434 INFO 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-15 10:57:29,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:29,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:29,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:29,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:29,617 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-15 10:57:29,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:29,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:29,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:30,034 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-02-15 10:57:30,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,052 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:30,219 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-02-15 10:57:30,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:30,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:30,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,452 INFO L478 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-15 10:57:30,465 INFO L478 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-15 10:57:30,483 INFO L478 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-15 10:57:30,496 INFO L478 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-15 10:57:30,508 INFO L478 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-15 10:57:30,646 INFO L303 Elim1Store]: Index analysis took 133 ms [2019-02-15 10:57:30,648 INFO L478 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-15 10:57:30,650 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,837 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,920 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,969 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,984 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:30,998 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,043 INFO L267 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-15 10:57:31,043 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:31,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,110 INFO L478 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-15 10:57:31,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:31,174 INFO L267 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-15 10:57:31,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:31,270 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-15 10:57:31,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:31,322 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-15 10:57:31,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:31,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:31,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:31,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:31,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:31,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:31,345 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-02-15 10:57:31,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:31,716 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-02-15 10:57:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:31,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:31,718 INFO L225 Difference]: With dead ends: 47 [2019-02-15 10:57:31,718 INFO L226 Difference]: Without dead ends: 45 [2019-02-15 10:57:31,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:57:31,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-15 10:57:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-02-15 10:57:31,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-15 10:57:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-02-15 10:57:31,726 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-02-15 10:57:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:31,726 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-02-15 10:57:31,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-02-15 10:57:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:31,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:31,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:31,728 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:31,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-15 10:57:31,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:31,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:31,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:31,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:31,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:31,785 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-15 10:57:31,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:31,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:31,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:31,786 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-15 10:57:31,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:31,788 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:31,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:31,795 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:31,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:31,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:31,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:31,796 INFO 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-15 10:57:31,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:31,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:31,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:31,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:31,949 INFO L478 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-15 10:57:31,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,969 INFO L478 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-15 10:57:31,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,986 INFO L478 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-15 10:57:31,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:31,995 INFO L478 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-15 10:57:32,023 INFO L478 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-15 10:57:32,024 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,110 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,178 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:32,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:32,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,413 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:32,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:32,493 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,521 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,544 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,561 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,599 INFO L267 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-15 10:57:32,599 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:32,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:32,674 INFO L478 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 72 [2019-02-15 10:57:32,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:32,709 INFO L267 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-15 10:57:32,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:32,776 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-15 10:57:32,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:32,786 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-15 10:57:32,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:32,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:57:32,806 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:32,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:32,808 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-02-15 10:57:32,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:32,890 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-02-15 10:57:32,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:57:32,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-15 10:57:32,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:32,892 INFO L225 Difference]: With dead ends: 23 [2019-02-15 10:57:32,892 INFO L226 Difference]: Without dead ends: 22 [2019-02-15 10:57:32,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-15 10:57:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-15 10:57:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-15 10:57:32,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-02-15 10:57:32,900 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-02-15 10:57:32,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:32,900 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-02-15 10:57:32,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-02-15 10:57:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:32,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:32,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:32,902 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:32,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-15 10:57:32,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:32,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:32,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:32,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:32,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:32,996 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-15 10:57:32,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:32,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:32,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:32,998 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-15 10:57:33,001 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:33,001 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:33,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:33,009 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:33,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:33,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:33,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:33,010 INFO 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-15 10:57:33,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:33,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:33,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:33,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:33,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:33,264 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-02-15 10:57:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,353 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:33,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,445 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:33,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:33,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:57:33,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,600 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,754 INFO L478 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-15 10:57:33,757 INFO L478 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-15 10:57:33,763 INFO L478 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-15 10:57:33,784 INFO L478 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-15 10:57:33,802 INFO L478 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-15 10:57:33,815 INFO L478 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-15 10:57:33,816 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,881 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,900 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:33,918 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:34,047 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:34,058 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:34,129 INFO L267 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-15 10:57:34,130 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-15 10:57:34,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,174 INFO L478 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 97 [2019-02-15 10:57:34,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:34,235 INFO L267 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-15 10:57:34,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:34,261 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-15 10:57:34,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:34,377 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-15 10:57:34,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:34,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:34,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:34,396 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-02-15 10:57:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:34,597 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-02-15 10:57:34,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:57:34,597 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:34,599 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:57:34,600 INFO L226 Difference]: Without dead ends: 36 [2019-02-15 10:57:34,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-15 10:57:34,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-02-15 10:57:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-15 10:57:34,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-02-15 10:57:34,608 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-02-15 10:57:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:34,608 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-02-15 10:57:34,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-02-15 10:57:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:57:34,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:34,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:57:34,609 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:34,610 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-15 10:57:34,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:34,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:34,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:34,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:34,699 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-15 10:57:34,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:34,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:34,700 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-15 10:57:34,700 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-15 10:57:34,702 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:34,702 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:34,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:34,714 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:34,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:34,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:34,714 INFO 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-15 10:57:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:34,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:34,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:34,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:34,758 INFO L478 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-15 10:57:34,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,784 INFO L478 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-15 10:57:34,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,792 INFO L478 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-15 10:57:34,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:34,802 INFO L478 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-15 10:57:34,936 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-02-15 10:57:34,938 INFO L478 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-15 10:57:34,938 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,181 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,195 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:35,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:35,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,317 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:35,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:35,374 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,390 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,404 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,458 INFO L267 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-15 10:57:35,459 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:35,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,511 INFO L478 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 72 [2019-02-15 10:57:35,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:35,542 INFO L267 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-15 10:57:35,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:35,560 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-15 10:57:35,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:35,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:35,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:35,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:35,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:35,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:35,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:35,612 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-02-15 10:57:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:35,781 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-02-15 10:57:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:35,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-15 10:57:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:35,782 INFO L225 Difference]: With dead ends: 49 [2019-02-15 10:57:35,782 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 10:57:35,783 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-15 10:57:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 10:57:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-02-15 10:57:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:57:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-02-15 10:57:35,790 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-02-15 10:57:35,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:35,790 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-02-15 10:57:35,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:35,790 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-02-15 10:57:35,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:35,791 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:35,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:35,791 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:35,792 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-02-15 10:57:35,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:35,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:35,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:35,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:35,861 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-15 10:57:35,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:35,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:35,861 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:35,862 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-02-15 10:57:35,863 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:35,863 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:35,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:35,870 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:35,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:35,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:35,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:35,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 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-15 10:57:35,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:35,882 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:35,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:35,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:35,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:35,918 INFO L478 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-15 10:57:35,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,931 INFO L478 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-15 10:57:35,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,943 INFO L478 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-15 10:57:35,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:35,972 INFO L478 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-15 10:57:35,980 INFO L478 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-15 10:57:35,981 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,010 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:36,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:36,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,212 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:36,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:36,266 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,286 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,304 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,323 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,360 INFO L267 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-15 10:57:36,361 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:36,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,409 INFO L478 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-15 10:57:36,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,440 INFO L267 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-15 10:57:36,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:36,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:36,522 INFO L478 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 80 [2019-02-15 10:57:36,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:36,568 INFO L267 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-15 10:57:36,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 10:57:36,587 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-15 10:57:36,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:36,611 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-15 10:57:36,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:36,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:36,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:36,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:36,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:36,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:36,632 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-02-15 10:57:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:37,251 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-02-15 10:57:37,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:37,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:37,253 INFO L225 Difference]: With dead ends: 61 [2019-02-15 10:57:37,253 INFO L226 Difference]: Without dead ends: 57 [2019-02-15 10:57:37,254 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-15 10:57:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-15 10:57:37,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-02-15 10:57:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-15 10:57:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-02-15 10:57:37,261 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-02-15 10:57:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:37,262 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-02-15 10:57:37,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-02-15 10:57:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:37,262 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:37,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:37,263 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:37,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:37,263 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-02-15 10:57:37,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:37,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:37,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:37,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:37,345 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-15 10:57:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:37,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:37,345 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:37,345 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-02-15 10:57:37,347 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:37,347 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:37,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:37,351 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:37,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:37,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:37,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:37,352 INFO 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-15 10:57:37,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:37,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:37,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:37,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:37,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,509 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:37,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,574 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:37,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:37,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:57:37,648 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,671 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,817 INFO L478 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-15 10:57:37,820 INFO L478 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-15 10:57:37,827 INFO L478 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-15 10:57:37,836 INFO L478 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-15 10:57:37,840 INFO L478 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-15 10:57:37,843 INFO L478 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-15 10:57:37,844 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,876 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,911 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,924 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,935 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:37,979 INFO L267 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-15 10:57:37,979 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:57:38,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,085 INFO L478 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-15 10:57:38,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:38,153 INFO L267 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-15 10:57:38,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:38,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:38,193 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:38,194 INFO L478 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 106 [2019-02-15 10:57:38,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:38,239 INFO L267 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-15 10:57:38,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 10:57:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:38,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:38,288 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-15 10:57:38,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:38,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:38,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:38,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:38,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:38,308 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-02-15 10:57:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:38,832 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-02-15 10:57:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:38,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:38,834 INFO L225 Difference]: With dead ends: 59 [2019-02-15 10:57:38,835 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:57:38,835 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-15 10:57:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:57:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-15 10:57:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:57:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-02-15 10:57:38,844 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-02-15 10:57:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:38,844 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-02-15 10:57:38,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-02-15 10:57:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:38,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:38,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:38,846 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-02-15 10:57:38,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:38,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:38,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:38,984 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-15 10:57:38,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:38,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:38,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:38,985 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-02-15 10:57:38,985 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:38,986 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:38,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:38,993 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:38,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:38,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:38,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:38,993 INFO 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-15 10:57:39,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:39,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:39,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:39,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:39,039 INFO L478 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-15 10:57:39,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,046 INFO L478 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-15 10:57:39,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,062 INFO L478 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-15 10:57:39,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,079 INFO L478 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-15 10:57:39,087 INFO L478 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-15 10:57:39,088 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,119 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:39,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:39,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,358 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:39,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:39,427 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,455 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,479 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,505 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,550 INFO L267 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-15 10:57:39,551 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:39,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,603 INFO L478 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-15 10:57:39,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,635 INFO L267 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-15 10:57:39,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:39,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:39,676 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:39,677 INFO L478 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 81 [2019-02-15 10:57:39,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:39,723 INFO L267 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-15 10:57:39,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-02-15 10:57:39,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-15 10:57:39,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:39,766 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-15 10:57:39,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:39,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:39,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:39,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:39,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:39,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:39,788 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-02-15 10:57:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:40,218 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-02-15 10:57:40,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:40,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:40,220 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:57:40,220 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:57:40,221 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-15 10:57:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:57:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-02-15 10:57:40,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-15 10:57:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-02-15 10:57:40,231 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-02-15 10:57:40,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:40,231 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-02-15 10:57:40,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:40,231 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-02-15 10:57:40,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:40,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:40,232 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:40,233 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:40,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:40,233 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-02-15 10:57:40,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:40,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:40,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:40,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:40,358 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-15 10:57:40,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:40,358 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:40,359 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:40,359 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-02-15 10:57:40,360 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:40,360 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:40,366 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:40,366 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:40,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:40,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:40,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:57:40,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:40,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:40,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:40,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:40,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:40,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,495 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:40,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:40,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:40,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,581 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:40,624 INFO L478 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-15 10:57:40,628 INFO L478 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-15 10:57:40,632 INFO L478 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-15 10:57:40,638 INFO L478 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-15 10:57:40,641 INFO L478 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-15 10:57:40,650 INFO L478 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-15 10:57:40,651 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,072 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,260 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,270 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,304 INFO L267 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-15 10:57:41,305 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:41,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,348 INFO L478 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-15 10:57:41,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,377 INFO L267 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-15 10:57:41,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:41,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:41,413 INFO L478 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 88 [2019-02-15 10:57:41,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:41,450 INFO L267 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-15 10:57:41,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 10:57:41,469 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-15 10:57:41,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:41,492 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-15 10:57:41,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:41,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:41,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:41,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:41,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:41,514 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-02-15 10:57:41,682 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-02-15 10:57:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:42,162 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-02-15 10:57:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:42,163 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:42,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:42,164 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:57:42,165 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:57:42,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:57:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-02-15 10:57:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:57:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-02-15 10:57:42,174 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-02-15 10:57:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:42,175 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-02-15 10:57:42,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-02-15 10:57:42,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:42,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:42,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:42,176 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:42,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:42,176 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-02-15 10:57:42,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:42,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:42,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:42,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:42,276 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-15 10:57:42,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:42,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:42,277 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:42,277 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-02-15 10:57:42,278 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:42,278 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:42,284 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:42,285 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:42,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:42,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:42,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:42,285 INFO 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-15 10:57:42,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:42,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:42,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:42,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:42,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:42,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,475 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:42,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:42,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,575 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,590 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,632 INFO L478 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-15 10:57:42,637 INFO L478 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-15 10:57:42,641 INFO L478 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-15 10:57:42,644 INFO L478 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-15 10:57:42,646 INFO L478 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-15 10:57:42,653 INFO L478 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-15 10:57:42,654 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,680 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,701 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,717 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,731 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,744 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,779 INFO L267 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-15 10:57:42,780 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:42,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,856 INFO L478 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 72 [2019-02-15 10:57:42,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,890 INFO L267 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-15 10:57:42,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:42,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:42,918 INFO L478 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 78 [2019-02-15 10:57:42,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:42,950 INFO L267 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-15 10:57:42,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 10:57:42,968 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-15 10:57:42,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:42,984 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-15 10:57:43,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:43,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:43,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:43,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:43,006 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-02-15 10:57:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:43,397 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-02-15 10:57:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:43,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:43,399 INFO L225 Difference]: With dead ends: 73 [2019-02-15 10:57:43,400 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:57:43,400 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-15 10:57:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:57:43,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-02-15 10:57:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:57:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-02-15 10:57:43,411 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-02-15 10:57:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:43,411 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-02-15 10:57:43,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-02-15 10:57:43,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:43,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:43,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:43,412 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:43,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:43,413 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-02-15 10:57:43,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:43,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:43,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:43,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:43,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:43,455 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-15 10:57:43,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:43,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:43,455 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:43,456 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-02-15 10:57:43,458 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:43,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:43,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:43,466 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:43,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:43,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:43,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:43,467 INFO 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-15 10:57:43,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:43,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:43,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:43,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:43,514 INFO L478 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-15 10:57:43,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,530 INFO L478 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-15 10:57:43,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,538 INFO L478 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-15 10:57:43,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,557 INFO L478 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-15 10:57:43,568 INFO L478 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-15 10:57:43,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,599 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,622 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:43,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:43,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,766 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:43,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:43,816 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,831 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,845 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,862 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:43,896 INFO L267 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-15 10:57:43,897 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:43,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:43,987 INFO L478 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 72 [2019-02-15 10:57:43,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,018 INFO L267 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-15 10:57:44,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:44,034 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-15 10:57:44,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:44,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-15 10:57:44,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:44,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:44,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:44,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:44,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:44,063 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-02-15 10:57:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:44,254 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-02-15 10:57:44,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:44,255 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:57:44,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:44,256 INFO L225 Difference]: With dead ends: 56 [2019-02-15 10:57:44,256 INFO L226 Difference]: Without dead ends: 55 [2019-02-15 10:57:44,257 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-15 10:57:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-15 10:57:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-02-15 10:57:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-15 10:57:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-02-15 10:57:44,268 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-02-15 10:57:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:44,268 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-02-15 10:57:44,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-02-15 10:57:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:44,269 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:44,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:44,270 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:44,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:44,270 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-02-15 10:57:44,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:44,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:44,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:44,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,385 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-15 10:57:44,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:44,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:44,386 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-02-15 10:57:44,388 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:44,388 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:44,392 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:44,392 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:44,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:44,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:44,393 INFO 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-15 10:57:44,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:44,403 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:44,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:44,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:44,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:44,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:44,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,563 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:44,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,643 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:44,764 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 10:57:44,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:44,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:57:44,787 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:44,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,012 INFO L478 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-15 10:57:45,014 INFO L478 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-15 10:57:45,017 INFO L478 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-15 10:57:45,019 INFO L478 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-15 10:57:45,023 INFO L478 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-15 10:57:45,026 INFO L478 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-15 10:57:45,027 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,069 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,089 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,104 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,116 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,128 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,173 INFO L267 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-15 10:57:45,174 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:57:45,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,225 INFO L478 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 97 [2019-02-15 10:57:45,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:45,297 INFO L267 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-15 10:57:45,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:45,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:45,535 INFO L303 Elim1Store]: Index analysis took 214 ms [2019-02-15 10:57:45,536 INFO L478 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 111 [2019-02-15 10:57:45,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,029 INFO L267 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-15 10:57:46,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-02-15 10:57:46,049 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-15 10:57:46,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:46,069 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-15 10:57:46,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:46,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:57:46,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:46,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:46,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:46,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:57:46,091 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-02-15 10:57:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:46,579 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-02-15 10:57:46,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:46,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:46,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:46,581 INFO L225 Difference]: With dead ends: 96 [2019-02-15 10:57:46,581 INFO L226 Difference]: Without dead ends: 93 [2019-02-15 10:57:46,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:57:46,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-15 10:57:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-02-15 10:57:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 10:57:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-02-15 10:57:46,595 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-02-15 10:57:46,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:46,595 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-02-15 10:57:46,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:46,595 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-02-15 10:57:46,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:46,596 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:46,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:46,597 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-02-15 10:57:46,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:46,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:46,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:46,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:46,732 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-15 10:57:46,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:46,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:46,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:46,733 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-02-15 10:57:46,735 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:46,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:46,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:46,743 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:46,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:46,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:46,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 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-15 10:57:46,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:46,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:46,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:46,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:46,786 INFO L478 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-15 10:57:46,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,814 INFO L478 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-15 10:57:46,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,821 INFO L478 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-15 10:57:46,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,828 INFO L478 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-15 10:57:46,840 INFO L478 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-15 10:57:46,841 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,887 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,908 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:46,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:46,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:47,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:47,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,055 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:47,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:47,127 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,143 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,159 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,175 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,208 INFO L267 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-15 10:57:47,209 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:47,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,251 INFO L478 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 72 [2019-02-15 10:57:47,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,280 INFO L267 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-15 10:57:47,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:47,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:47,330 INFO L478 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 86 [2019-02-15 10:57:47,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:47,365 INFO L267 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-15 10:57:47,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-15 10:57:47,389 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-15 10:57:47,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:47,414 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-15 10:57:47,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:47,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:47,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:47,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:47,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:47,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:47,439 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-02-15 10:57:47,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:47,921 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-02-15 10:57:47,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:47,922 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:47,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:47,923 INFO L225 Difference]: With dead ends: 84 [2019-02-15 10:57:47,923 INFO L226 Difference]: Without dead ends: 82 [2019-02-15 10:57:47,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-15 10:57:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-15 10:57:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 10:57:47,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-02-15 10:57:47,937 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-02-15 10:57:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:47,938 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-02-15 10:57:47,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-02-15 10:57:47,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:47,939 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:47,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:47,939 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:47,939 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-02-15 10:57:47,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:47,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:47,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:47,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:47,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:48,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-15 10:57:48,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:48,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:48,003 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:48,003 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-02-15 10:57:48,006 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:48,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:48,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:48,009 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:48,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:48,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:48,010 INFO 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-15 10:57:48,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:48,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:48,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:48,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:48,056 INFO L478 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-15 10:57:48,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,062 INFO L478 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-15 10:57:48,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,070 INFO L478 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-15 10:57:48,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,156 INFO L478 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-15 10:57:48,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,170 INFO L478 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-15 10:57:48,170 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,208 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,232 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:48,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:48,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,399 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:48,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,461 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:48,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:57:48,534 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,560 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,585 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,611 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,637 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,684 INFO L267 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-15 10:57:48,684 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:57:48,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,741 INFO L478 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 97 [2019-02-15 10:57:48,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,786 INFO L267 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-15 10:57:48,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:48,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:48,841 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:48,842 INFO L478 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 112 [2019-02-15 10:57:48,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:48,900 INFO L267 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-15 10:57:48,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 10:57:48,919 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-15 10:57:48,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:48,941 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-15 10:57:48,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:48,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:48,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:48,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:48,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:48,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:48,961 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-02-15 10:57:49,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:49,720 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-02-15 10:57:49,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:49,720 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:49,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:49,721 INFO L225 Difference]: With dead ends: 91 [2019-02-15 10:57:49,722 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:57:49,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:57:49,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-02-15 10:57:49,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-15 10:57:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-02-15 10:57:49,736 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-02-15 10:57:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:49,737 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-02-15 10:57:49,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:49,737 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-02-15 10:57:49,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:49,738 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:49,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:49,738 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:49,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:49,739 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-02-15 10:57:49,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:49,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:49,805 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-15 10:57:49,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:49,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:49,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:49,806 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-02-15 10:57:49,807 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:49,808 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:49,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:49,812 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:49,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:49,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:49,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:49,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:57:49,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:49,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:49,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:49,834 INFO L478 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-15 10:57:49,840 INFO L478 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-15 10:57:49,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,851 INFO L478 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-15 10:57:49,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,886 INFO L478 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-15 10:57:49,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:49,907 INFO L478 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-15 10:57:49,917 INFO L478 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-15 10:57:49,918 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:49,944 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,073 INFO L478 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 43 treesize of output 39 [2019-02-15 10:57:50,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,091 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:50,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:57:50,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:57:50,174 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,400 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,450 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,466 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:50,498 INFO L267 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-15 10:57:50,498 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-02-15 10:57:50,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,535 INFO L478 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 72 [2019-02-15 10:57:50,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:57:50,631 INFO L267 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-15 10:57:50,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-02-15 10:57:50,681 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-15 10:57:50,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:50,685 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-15 10:57:50,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 10:57:50,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-15 10:57:50,705 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:57:50,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:57:50,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:57:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:50,706 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-02-15 10:57:50,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:50,823 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-02-15 10:57:50,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:57:50,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-15 10:57:50,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:50,825 INFO L225 Difference]: With dead ends: 90 [2019-02-15 10:57:50,826 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:57:50,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-15 10:57:50,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:57:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-02-15 10:57:50,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-15 10:57:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-02-15 10:57:50,842 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-02-15 10:57:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:50,842 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-02-15 10:57:50,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:57:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-02-15 10:57:50,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:50,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:50,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:50,844 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:50,844 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-02-15 10:57:50,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:50,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:50,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:50,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:50,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:50,919 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-15 10:57:50,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:50,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:50,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:50,920 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-02-15 10:57:50,921 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:50,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:50,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:50,926 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:50,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:50,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:50,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:50,926 INFO 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-15 10:57:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:50,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:50,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:50,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:50,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:51,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:51,161 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-02-15 10:57:51,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,170 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:51,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:51,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,318 INFO L478 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-15 10:57:51,321 INFO L478 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-15 10:57:51,325 INFO L478 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-15 10:57:51,328 INFO L478 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-15 10:57:51,331 INFO L478 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-15 10:57:51,340 INFO L478 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-15 10:57:51,341 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,367 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,387 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,403 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,416 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,428 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,461 INFO L267 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-15 10:57:51,462 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:51,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,549 INFO L478 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 72 [2019-02-15 10:57:51,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,579 INFO L267 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-15 10:57:51,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:51,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:51,606 INFO L478 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 88 [2019-02-15 10:57:51,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:51,639 INFO L267 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-15 10:57:51,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 10:57:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:57:51,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:51,677 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-15 10:57:51,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:51,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:51,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:51,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:51,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:51,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:51,698 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-02-15 10:57:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:52,098 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-02-15 10:57:52,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:52,099 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-15 10:57:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:52,101 INFO L225 Difference]: With dead ends: 121 [2019-02-15 10:57:52,101 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 10:57:52,102 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-15 10:57:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 10:57:52,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-02-15 10:57:52,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 10:57:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-15 10:57:52,117 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-15 10:57:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:52,117 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-15 10:57:52,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:52,118 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-15 10:57:52,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-15 10:57:52,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:52,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-15 10:57:52,119 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:52,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:52,120 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-02-15 10:57:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:52,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:52,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:52,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:52,294 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-15 10:57:52,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:52,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:52,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-15 10:57:52,295 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-02-15 10:57:52,296 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:52,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:52,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:52,300 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:57:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:52,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:52,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:52,301 INFO 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-15 10:57:52,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:52,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:52,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:52,368 INFO L478 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-15 10:57:52,405 INFO L478 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-15 10:57:52,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,493 INFO L478 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-15 10:57:52,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,589 INFO L478 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-15 10:57:52,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:52,715 INFO L303 Elim1Store]: Index analysis took 124 ms [2019-02-15 10:57:52,716 INFO L478 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-15 10:57:52,854 INFO L303 Elim1Store]: Index analysis took 136 ms [2019-02-15 10:57:52,855 INFO L478 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-15 10:57:52,855 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,058 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,141 INFO L478 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 43 treesize of output 39 [2019-02-15 10:57:53,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,157 INFO L478 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 36 treesize of output 49 [2019-02-15 10:57:53,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:57:53,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:57:53,249 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,263 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,277 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,292 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,322 INFO L267 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-15 10:57:53,323 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 10:57:53,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,376 INFO L478 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 68 [2019-02-15 10:57:53,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:53,405 INFO L267 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-15 10:57:53,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-15 10:57:53,471 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-15 10:57:53,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:53,482 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-15 10:57:53,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:53,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:57:53,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:53,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:57:53,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:57:53,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:57:53,502 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-02-15 10:57:53,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:53,730 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-02-15 10:57:53,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:57:53,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-15 10:57:53,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:53,732 INFO L225 Difference]: With dead ends: 110 [2019-02-15 10:57:53,732 INFO L226 Difference]: Without dead ends: 109 [2019-02-15 10:57:53,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:57:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-15 10:57:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-02-15 10:57:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 10:57:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-02-15 10:57:53,748 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-02-15 10:57:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:53,748 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-02-15 10:57:53,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:57:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-02-15 10:57:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:53,749 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:53,750 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-15 10:57:53,750 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:53,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-02-15 10:57:53,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:53,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:53,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:53,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:53,823 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-15 10:57:53,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:53,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:53,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:57:53,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:57:53,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:53,824 INFO 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-15 10:57:53,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:57:53,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:57:53,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:57:53,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:57:53,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:53,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:53,935 INFO L478 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-15 10:57:53,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,940 INFO L478 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-15 10:57:53,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,948 INFO L478 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-15 10:57:53,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,956 INFO L478 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-15 10:57:53,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:53,984 INFO L478 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-15 10:57:53,984 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,027 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,111 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:54,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:54,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,276 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:54,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,337 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:54,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:57:54,412 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,436 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,461 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,487 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,560 INFO L267 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-15 10:57:54,560 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-02-15 10:57:54,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,585 INFO L478 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-15 10:57:54,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,650 INFO L267 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-15 10:57:54,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:54,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,701 INFO L478 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 103 [2019-02-15 10:57:54,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,762 INFO L267 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-15 10:57:54,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-02-15 10:57:54,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,810 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:54,817 INFO L478 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 113 [2019-02-15 10:57:54,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:54,886 INFO L267 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-15 10:57:54,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-02-15 10:57:55,122 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-15 10:57:55,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:55,605 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-15 10:57:55,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:55,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:57:55,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:55,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:55,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:55,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:55,668 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-02-15 10:57:56,566 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-02-15 10:57:57,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:57,215 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-02-15 10:57:57,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:57:57,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:57:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:57,217 INFO L225 Difference]: With dead ends: 133 [2019-02-15 10:57:57,218 INFO L226 Difference]: Without dead ends: 128 [2019-02-15 10:57:57,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-02-15 10:57:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-02-15 10:57:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-15 10:57:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-02-15 10:57:57,233 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-02-15 10:57:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:57,234 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-02-15 10:57:57,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:57:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-02-15 10:57:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:57,235 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:57,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:57,235 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:57,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-02-15 10:57:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:57,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:57:57,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:57,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:57,398 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-15 10:57:57,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:57,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:57,399 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:57,399 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-02-15 10:57:57,400 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:57,400 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:57,403 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:57,403 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:57:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:57,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:57,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:57,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:57:57,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:57,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:57,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:57,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:57:57,477 INFO L478 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-15 10:57:57,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,486 INFO L478 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-15 10:57:57,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,492 INFO L478 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-15 10:57:57,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,500 INFO L478 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-15 10:57:57,530 INFO L478 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-15 10:57:57,531 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,561 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,617 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:57:57,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:57:57,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,739 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:57:57,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:57:57,789 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,806 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,821 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,837 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,871 INFO L267 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-15 10:57:57,871 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:57:57,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,912 INFO L478 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-15 10:57:57,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:57,940 INFO L267 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-15 10:57:57,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:57:57,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:57,967 INFO L478 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 88 [2019-02-15 10:57:57,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,002 INFO L267 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-15 10:57:58,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 10:57:58,065 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-15 10:57:58,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:58,084 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-15 10:57:58,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:58,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:57:58,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:58,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:57:58,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:57:58,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:57:58,105 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-02-15 10:57:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:57:58,454 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-02-15 10:57:58,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:57:58,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:57:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:57:58,456 INFO L225 Difference]: With dead ends: 125 [2019-02-15 10:57:58,456 INFO L226 Difference]: Without dead ends: 124 [2019-02-15 10:57:58,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:57:58,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-15 10:57:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-02-15 10:57:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-15 10:57:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-02-15 10:57:58,476 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-02-15 10:57:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:57:58,476 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-02-15 10:57:58,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:57:58,477 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-02-15 10:57:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:57:58,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:57:58,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:57:58,478 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:57:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-02-15 10:57:58,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:57:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:57:58,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:57:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:58,628 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-15 10:57:58,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:58,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:57:58,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:57:58,629 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-02-15 10:57:58,630 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:57:58,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:57:58,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:57:58,633 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:57:58,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:57:58,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:57:58,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:57:58,634 INFO 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-15 10:57:58,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:57:58,645 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:57:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:57:58,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:57:58,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:57:58,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:57:58,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,768 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:57:58,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,825 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:57:58,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:58,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:57:58,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,934 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:58,977 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,069 INFO L478 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-15 10:57:59,072 INFO L478 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-15 10:57:59,075 INFO L478 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-15 10:57:59,078 INFO L478 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-15 10:57:59,083 INFO L478 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-15 10:57:59,086 INFO L478 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-15 10:57:59,087 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,122 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,141 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,156 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,170 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,182 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,229 INFO L267 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-15 10:57:59,229 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:57:59,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,265 INFO L478 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-15 10:57:59,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,328 INFO L267 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-15 10:57:59,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:57:59,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,366 INFO L478 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 105 [2019-02-15 10:57:59,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,414 INFO L267 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-15 10:57:59,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:57:59,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,453 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:57:59,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:57:59,455 INFO L478 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 118 [2019-02-15 10:57:59,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:57:59,505 INFO L267 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-15 10:57:59,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:57:59,530 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-15 10:57:59,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:57:59,575 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-15 10:57:59,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:57:59,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:57:59,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:57:59,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:57:59,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:57:59,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:57:59,595 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-02-15 10:57:59,739 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-02-15 10:58:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:01,375 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-02-15 10:58:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:58:01,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:01,378 INFO L225 Difference]: With dead ends: 149 [2019-02-15 10:58:01,378 INFO L226 Difference]: Without dead ends: 145 [2019-02-15 10:58:01,379 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-15 10:58:01,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-02-15 10:58:01,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-02-15 10:58:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-15 10:58:01,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-02-15 10:58:01,400 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-02-15 10:58:01,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:01,400 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-02-15 10:58:01,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:01,400 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-02-15 10:58:01,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:01,401 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:01,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:01,401 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:01,402 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-02-15 10:58:01,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:01,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:01,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:01,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:01,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:01,534 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-15 10:58:01,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:01,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:01,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:01,534 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-02-15 10:58:01,536 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:01,536 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:01,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:01,539 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:01,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:01,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:01,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:01,539 INFO 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-15 10:58:01,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:01,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:01,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:01,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:58:01,584 INFO L478 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-15 10:58:01,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,590 INFO L478 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-15 10:58:01,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,599 INFO L478 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-15 10:58:01,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,611 INFO L478 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-15 10:58:01,619 INFO L478 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-15 10:58:01,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,648 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:01,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:01,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,821 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:01,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:01,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:01,871 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,887 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,903 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,918 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:01,951 INFO L267 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-15 10:58:01,952 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:02,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,010 INFO L478 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-15 10:58:02,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,042 INFO L267 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-15 10:58:02,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:02,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,088 INFO L478 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 80 [2019-02-15 10:58:02,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,118 INFO L267 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-15 10:58:02,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 10:58:02,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,150 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:02,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:02,152 INFO L478 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 97 [2019-02-15 10:58:02,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:02,187 INFO L267 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-15 10:58:02,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 10:58:02,207 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-15 10:58:02,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:02,245 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-15 10:58:02,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:02,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:02,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:02,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:02,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:02,267 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-02-15 10:58:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:02,826 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-02-15 10:58:02,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:02,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:02,829 INFO L225 Difference]: With dead ends: 138 [2019-02-15 10:58:02,829 INFO L226 Difference]: Without dead ends: 136 [2019-02-15 10:58:02,830 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-15 10:58:02,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-15 10:58:02,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-02-15 10:58:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-15 10:58:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-02-15 10:58:02,848 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-02-15 10:58:02,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:02,849 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-02-15 10:58:02,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-02-15 10:58:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:02,849 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:02,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:02,850 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:02,850 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-02-15 10:58:02,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:02,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:02,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:02,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:02,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-15 10:58:02,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:02,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:02,963 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:02,964 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-02-15 10:58:02,964 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:02,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:02,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:02,968 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:02,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:02,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:02,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:02,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:58:02,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:02,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:02,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:03,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:03,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:03,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,106 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:03,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,165 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:03,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:03,249 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,399 INFO L478 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-15 10:58:03,402 INFO L478 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-15 10:58:03,405 INFO L478 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-15 10:58:03,408 INFO L478 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-15 10:58:03,412 INFO L478 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-15 10:58:03,436 INFO L478 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-15 10:58:03,436 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,759 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,780 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,795 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,809 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,821 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,868 INFO L267 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-15 10:58:03,868 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:03,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,895 INFO L478 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-15 10:58:03,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:03,943 INFO L267 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-15 10:58:03,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:03,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:03,975 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:03,976 INFO L478 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 106 [2019-02-15 10:58:03,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:04,023 INFO L267 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-15 10:58:04,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 10:58:04,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:04,058 INFO L478 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 115 [2019-02-15 10:58:04,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:04,128 INFO L267 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-15 10:58:04,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-15 10:58:04,147 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-15 10:58:04,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:04,171 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-15 10:58:04,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:04,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:58:04,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:04,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:04,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:04,192 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-02-15 10:58:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:04,777 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-02-15 10:58:04,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:58:04,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:04,781 INFO L225 Difference]: With dead ends: 152 [2019-02-15 10:58:04,781 INFO L226 Difference]: Without dead ends: 151 [2019-02-15 10:58:04,782 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-15 10:58:04,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-02-15 10:58:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-02-15 10:58:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-15 10:58:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-02-15 10:58:04,804 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-02-15 10:58:04,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:04,805 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-02-15 10:58:04,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-02-15 10:58:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:04,805 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:04,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:04,806 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:04,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:04,806 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-02-15 10:58:04,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:04,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:04,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:04,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:04,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:04,955 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-15 10:58:04,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:04,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:04,956 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:04,956 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-02-15 10:58:04,957 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:04,958 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:04,960 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:04,960 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:04,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:04,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:04,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:04,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 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-15 10:58:04,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:04,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:04,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:05,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:05,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:05,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,099 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:05,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,182 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:05,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:05,267 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,471 INFO L478 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-15 10:58:05,474 INFO L478 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-15 10:58:05,476 INFO L478 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-15 10:58:05,478 INFO L478 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-15 10:58:05,482 INFO L478 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-15 10:58:05,485 INFO L478 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-15 10:58:05,486 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,525 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,544 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,561 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,573 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,586 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,633 INFO L267 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-15 10:58:05,633 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:05,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,670 INFO L478 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-15 10:58:05,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,714 INFO L267 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-15 10:58:05,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:05,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,750 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:05,751 INFO L478 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 106 [2019-02-15 10:58:05,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,799 INFO L267 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-15 10:58:05,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 10:58:05,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:05,862 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:05,863 INFO L478 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 108 [2019-02-15 10:58:05,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:05,994 INFO L267 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-15 10:58:05,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-02-15 10:58:07,475 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-15 10:58:07,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:07,516 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-15 10:58:07,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:07,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:07,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:07,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:07,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:07,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:07,537 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-02-15 10:58:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:08,291 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-02-15 10:58:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:08,291 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:08,294 INFO L225 Difference]: With dead ends: 141 [2019-02-15 10:58:08,294 INFO L226 Difference]: Without dead ends: 140 [2019-02-15 10:58:08,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:58:08,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-15 10:58:08,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-02-15 10:58:08,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-15 10:58:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-02-15 10:58:08,326 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-02-15 10:58:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:08,327 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-02-15 10:58:08,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-02-15 10:58:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:08,328 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:08,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:08,329 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:08,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:08,329 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-02-15 10:58:08,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:08,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:08,330 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:08,465 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-15 10:58:08,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:08,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:08,466 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:08,466 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-02-15 10:58:08,467 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:08,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:08,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:08,470 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:08,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:08,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:08,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:08,471 INFO 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-15 10:58:08,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:08,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:08,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:08,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:58:08,529 INFO L478 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-15 10:58:08,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,535 INFO L478 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-15 10:58:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,544 INFO L478 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-15 10:58:08,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,571 INFO L478 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-15 10:58:08,578 INFO L478 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-15 10:58:08,579 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,608 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:08,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:08,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,782 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:08,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:08,835 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,852 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,869 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,885 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,919 INFO L267 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-15 10:58:08,920 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:08,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:08,961 INFO L478 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-15 10:58:08,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:08,990 INFO L267 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-15 10:58:08,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:09,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,018 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:09,019 INFO L478 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 81 [2019-02-15 10:58:09,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,058 INFO L267 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-15 10:58:09,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-02-15 10:58:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:09,091 INFO L478 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 90 [2019-02-15 10:58:09,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:09,126 INFO L267 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-15 10:58:09,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 10:58:09,144 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-15 10:58:09,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:09,169 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-15 10:58:09,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:09,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:58:09,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:09,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:09,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:09,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:09,191 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-02-15 10:58:09,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:09,857 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-02-15 10:58:09,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:58:09,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:09,860 INFO L225 Difference]: With dead ends: 163 [2019-02-15 10:58:09,860 INFO L226 Difference]: Without dead ends: 162 [2019-02-15 10:58:09,861 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-15 10:58:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-02-15 10:58:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-02-15 10:58:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-15 10:58:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-02-15 10:58:09,885 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-02-15 10:58:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:09,886 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-02-15 10:58:09,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-02-15 10:58:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:09,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:09,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:09,887 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-02-15 10:58:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:09,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:09,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:09,995 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-15 10:58:09,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:09,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:09,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:09,996 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-02-15 10:58:09,997 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:09,997 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:10,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:10,000 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:10,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:10,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:10,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 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-15 10:58:10,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:10,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:10,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:10,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:10,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:10,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,152 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:10,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,222 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:10,356 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-02-15 10:58:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:10,369 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,395 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,516 INFO L478 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-15 10:58:10,519 INFO L478 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-15 10:58:10,523 INFO L478 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-15 10:58:10,526 INFO L478 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-15 10:58:10,529 INFO L478 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-15 10:58:10,531 INFO L478 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-15 10:58:10,532 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,568 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,589 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,606 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,620 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,631 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,677 INFO L267 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-15 10:58:10,678 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:10,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,719 INFO L478 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-15 10:58:10,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,763 INFO L267 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-15 10:58:10,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:10,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,802 INFO L478 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 113 [2019-02-15 10:58:10,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,851 INFO L267 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-15 10:58:10,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:58:10,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,889 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:10,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:10,891 INFO L478 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 122 [2019-02-15 10:58:10,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:10,941 INFO L267 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-15 10:58:10,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:58:10,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-15 10:58:10,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:11,000 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-15 10:58:11,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:11,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:11,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:11,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:11,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:11,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:11,019 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-02-15 10:58:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:11,714 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-02-15 10:58:11,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:11,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:11,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:11,717 INFO L225 Difference]: With dead ends: 163 [2019-02-15 10:58:11,717 INFO L226 Difference]: Without dead ends: 160 [2019-02-15 10:58:11,717 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-15 10:58:11,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-15 10:58:11,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-02-15 10:58:11,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-15 10:58:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-02-15 10:58:11,743 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-02-15 10:58:11,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:11,743 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-02-15 10:58:11,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-02-15 10:58:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:11,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:11,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:11,744 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:11,745 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-02-15 10:58:11,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:11,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:11,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:11,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:58:11,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:11,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:11,845 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:11,846 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-02-15 10:58:11,847 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:11,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:11,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:11,849 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:11,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:11,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:11,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:11,850 INFO 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-15 10:58:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:11,861 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:11,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:11,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:11,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:11,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:11,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:11,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:11,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:11,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:11,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:11,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:11,967 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:12,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:12,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,038 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,095 INFO L478 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-15 10:58:12,098 INFO L478 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-15 10:58:12,101 INFO L478 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-15 10:58:12,104 INFO L478 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-15 10:58:12,107 INFO L478 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-15 10:58:12,114 INFO L478 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-15 10:58:12,115 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,143 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,164 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,180 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,194 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,243 INFO L267 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-15 10:58:12,244 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:12,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,338 INFO L478 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-15 10:58:12,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,389 INFO L267 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-15 10:58:12,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:12,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,426 INFO L478 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 88 [2019-02-15 10:58:12,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,462 INFO L267 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-15 10:58:12,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 10:58:12,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,537 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:12,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:12,539 INFO L478 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 97 [2019-02-15 10:58:12,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:12,575 INFO L267 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-15 10:58:12,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 10:58:12,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-15 10:58:12,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:12,635 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-15 10:58:12,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:12,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:12,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:12,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:12,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:12,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:12,656 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-02-15 10:58:13,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:13,210 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-02-15 10:58:13,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:13,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:13,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:13,213 INFO L225 Difference]: With dead ends: 165 [2019-02-15 10:58:13,214 INFO L226 Difference]: Without dead ends: 163 [2019-02-15 10:58:13,214 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-15 10:58:13,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-15 10:58:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-02-15 10:58:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-02-15 10:58:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-02-15 10:58:13,241 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-02-15 10:58:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:13,241 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-02-15 10:58:13,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-02-15 10:58:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:13,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:13,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:13,242 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-02-15 10:58:13,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:13,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:13,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:13,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:13,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:13,286 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-15 10:58:13,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:13,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:13,287 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:13,287 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-02-15 10:58:13,288 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:13,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:13,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:13,291 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:13,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:13,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:13,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:58:13,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:13,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:13,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:13,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:58:13,420 INFO L478 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-15 10:58:13,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,429 INFO L478 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-15 10:58:13,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,436 INFO L478 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-15 10:58:13,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,444 INFO L478 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-15 10:58:13,453 INFO L478 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-15 10:58:13,453 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,479 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,499 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:13,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:13,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,635 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:13,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:13,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:13,680 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,695 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,709 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,724 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:13,755 INFO L267 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-15 10:58:13,755 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:14,201 WARN L181 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-02-15 10:58:14,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,206 INFO L478 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 72 [2019-02-15 10:58:14,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,235 INFO L267 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-15 10:58:14,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:14,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,260 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:14,261 INFO L478 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 80 [2019-02-15 10:58:14,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:14,290 INFO L267 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-15 10:58:14,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-15 10:58:14,306 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-15 10:58:14,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:14,325 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-15 10:58:14,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:14,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:58:14,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:14,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:58:14,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:58:14,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:58:14,345 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-02-15 10:58:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:14,621 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-02-15 10:58:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:14,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-15 10:58:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:14,623 INFO L225 Difference]: With dead ends: 158 [2019-02-15 10:58:14,623 INFO L226 Difference]: Without dead ends: 156 [2019-02-15 10:58:14,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:58:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-02-15 10:58:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-02-15 10:58:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-15 10:58:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-02-15 10:58:14,647 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-02-15 10:58:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:14,647 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-02-15 10:58:14,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:58:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-02-15 10:58:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:14,648 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:14,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:14,649 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:14,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:14,649 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-02-15 10:58:14,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:14,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:14,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:14,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:14,829 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-15 10:58:14,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:14,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:14,830 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:58:14,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:58:14,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:14,830 INFO 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-15 10:58:14,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:58:14,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:58:14,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:58:14,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:58:14,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:14,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:14,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:14,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:14,954 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:15,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,009 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:15,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:15,079 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,138 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,163 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,222 INFO L478 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-15 10:58:15,224 INFO L478 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-15 10:58:15,228 INFO L478 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-15 10:58:15,231 INFO L478 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-15 10:58:15,233 INFO L478 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-15 10:58:15,236 INFO L478 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-15 10:58:15,237 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,272 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,292 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,307 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,319 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,331 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,374 INFO L267 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-15 10:58:15,374 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:15,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,408 INFO L478 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 97 [2019-02-15 10:58:15,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,450 INFO L267 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-15 10:58:15,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:15,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,480 INFO L478 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 111 [2019-02-15 10:58:15,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,537 INFO L267 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-15 10:58:15,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 10:58:15,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:15,573 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:15,574 INFO L478 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 118 [2019-02-15 10:58:15,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:15,622 INFO L267 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-15 10:58:15,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:58:15,644 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-15 10:58:15,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:15,666 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-15 10:58:15,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:15,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-15 10:58:15,683 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:15,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:15,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-15 10:58:15,684 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-02-15 10:58:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:16,354 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-02-15 10:58:16,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:58:16,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:16,357 INFO L225 Difference]: With dead ends: 241 [2019-02-15 10:58:16,357 INFO L226 Difference]: Without dead ends: 235 [2019-02-15 10:58:16,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:58:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-02-15 10:58:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-02-15 10:58:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-15 10:58:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-02-15 10:58:16,393 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-02-15 10:58:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:16,393 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-02-15 10:58:16,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-02-15 10:58:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:16,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:16,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:16,395 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:16,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:16,395 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-02-15 10:58:16,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:16,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:16,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:58:16,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:16,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:16,787 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-15 10:58:16,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:16,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:16,788 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:16,788 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-02-15 10:58:16,789 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:16,789 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:16,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:16,791 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:16,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:16,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:16,792 INFO 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-15 10:58:16,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:16,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:16,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:16,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:58:16,849 INFO L478 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-15 10:58:16,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,855 INFO L478 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-15 10:58:16,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,860 INFO L478 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-15 10:58:16,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:16,868 INFO L478 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-15 10:58:16,875 INFO L478 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-15 10:58:16,876 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,911 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,969 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:16,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:17,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:17,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,094 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:17,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:17,140 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,161 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,176 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,191 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,222 INFO L267 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-15 10:58:17,222 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:17,450 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-15 10:58:17,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,605 INFO L303 Elim1Store]: Index analysis took 150 ms [2019-02-15 10:58:17,613 INFO L478 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 81 [2019-02-15 10:58:17,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:17,715 INFO L267 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-15 10:58:17,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-02-15 10:58:17,922 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-02-15 10:58:17,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:17,931 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:17,931 INFO L478 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 72 [2019-02-15 10:58:17,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:17,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:18,038 INFO L478 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 107 [2019-02-15 10:58:18,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-15 10:58:18,377 INFO L267 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-15 10:58:18,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-02-15 10:58:18,924 WARN L181 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-02-15 10:58:18,927 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-15 10:58:18,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:18,957 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-15 10:58:18,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:18,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:18,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:18,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:18,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:18,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:18,976 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-02-15 10:58:19,454 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-15 10:58:19,957 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-02-15 10:58:20,343 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-02-15 10:58:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:20,647 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-02-15 10:58:20,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:20,647 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:58:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:20,650 INFO L225 Difference]: With dead ends: 208 [2019-02-15 10:58:20,650 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 10:58:20,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 10:58:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-02-15 10:58:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-15 10:58:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-02-15 10:58:20,685 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-02-15 10:58:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:20,685 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-02-15 10:58:20,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-02-15 10:58:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:20,686 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:20,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:20,686 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:20,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:20,686 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-02-15 10:58:20,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:20,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:20,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:20,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:20,812 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-15 10:58:20,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:20,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:20,813 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:20,813 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-02-15 10:58:20,814 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:20,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:20,817 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:20,817 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:20,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:20,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:20,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:20,818 INFO 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-15 10:58:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:20,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:20,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:20,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:20,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:20,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,926 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:20,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:20,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:20,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:20,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,042 INFO L478 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-15 10:58:21,044 INFO L478 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-15 10:58:21,047 INFO L478 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-15 10:58:21,050 INFO L478 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-15 10:58:21,052 INFO L478 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-15 10:58:21,061 INFO L478 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-15 10:58:21,062 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,085 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,104 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,131 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:21,173 INFO L267 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-15 10:58:21,173 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:21,401 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-15 10:58:21,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,418 INFO L478 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 81 [2019-02-15 10:58:21,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:21,523 INFO L267 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-15 10:58:21,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-15 10:58:21,737 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-15 10:58:21,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,761 INFO L478 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 103 [2019-02-15 10:58:21,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:58:21,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:21,922 INFO L478 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 89 [2019-02-15 10:58:21,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:22,004 INFO L267 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-15 10:58:22,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-02-15 10:58:22,230 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-02-15 10:58:22,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,274 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:22,295 INFO L478 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 118 [2019-02-15 10:58:22,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 10:58:22,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,589 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:22,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,590 INFO L478 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 88 [2019-02-15 10:58:22,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:22,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:22,747 INFO L478 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 110 [2019-02-15 10:58:22,747 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:22,898 INFO L267 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-15 10:58:22,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-02-15 10:58:23,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-15 10:58:23,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:23,053 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-15 10:58:23,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:23,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:58:23,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:23,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:23,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:23,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:23,072 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-02-15 10:58:23,903 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-02-15 10:58:24,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:24,408 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-02-15 10:58:24,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:58:24,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:24,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:24,412 INFO L225 Difference]: With dead ends: 280 [2019-02-15 10:58:24,412 INFO L226 Difference]: Without dead ends: 279 [2019-02-15 10:58:24,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:58:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-02-15 10:58:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-02-15 10:58:24,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-15 10:58:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-02-15 10:58:24,458 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-02-15 10:58:24,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:24,458 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-02-15 10:58:24,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-02-15 10:58:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:24,459 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:24,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:24,460 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-02-15 10:58:24,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:24,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:24,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:24,811 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-02-15 10:58:24,812 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-15 10:58:24,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:58:24,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-15 10:58:24,812 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:58:24,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 10:58:24,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 10:58:24,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-15 10:58:24,813 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-02-15 10:58:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:24,966 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-02-15 10:58:24,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:58:24,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-15 10:58:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:24,970 INFO L225 Difference]: With dead ends: 201 [2019-02-15 10:58:24,970 INFO L226 Difference]: Without dead ends: 198 [2019-02-15 10:58:24,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 10:58:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-02-15 10:58:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-02-15 10:58:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-15 10:58:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-02-15 10:58:25,014 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-02-15 10:58:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:25,015 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-02-15 10:58:25,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 10:58:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-02-15 10:58:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:25,016 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:25,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:25,016 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-02-15 10:58:25,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:25,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:25,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:25,226 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-15 10:58:25,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:25,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:25,227 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:25,227 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-02-15 10:58:25,228 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:25,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:25,230 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:25,230 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:25,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:25,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:25,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:25,231 INFO 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-15 10:58:25,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:25,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:25,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:25,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:25,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:25,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,340 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:25,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:25,391 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,484 INFO L478 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-15 10:58:25,487 INFO L478 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-15 10:58:25,489 INFO L478 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-15 10:58:25,493 INFO L478 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-15 10:58:25,500 INFO L478 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-15 10:58:25,506 INFO L478 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-15 10:58:25,507 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,531 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,550 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,565 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,577 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,620 INFO L267 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-15 10:58:25,620 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:25,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,660 INFO L478 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 72 [2019-02-15 10:58:25,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,695 INFO L267 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-15 10:58:25,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:25,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:25,721 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:25,722 INFO L478 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 80 [2019-02-15 10:58:25,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:25,750 INFO L267 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-15 10:58:25,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-15 10:58:25,771 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-15 10:58:25,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:25,791 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-15 10:58:25,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:25,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:25,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:25,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:25,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:25,811 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-02-15 10:58:26,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:26,120 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-02-15 10:58:26,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:26,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:58:26,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:26,123 INFO L225 Difference]: With dead ends: 208 [2019-02-15 10:58:26,123 INFO L226 Difference]: Without dead ends: 207 [2019-02-15 10:58:26,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:26,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-02-15 10:58:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-02-15 10:58:26,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-02-15 10:58:26,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-02-15 10:58:26,156 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-02-15 10:58:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:26,156 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-02-15 10:58:26,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:26,156 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-02-15 10:58:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:26,157 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:26,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:26,157 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:26,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-02-15 10:58:26,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:26,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:26,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:26,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:26,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:26,301 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-15 10:58:26,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:26,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:26,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:26,301 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-02-15 10:58:26,302 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:26,303 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:26,305 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:26,305 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:26,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:26,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:26,306 INFO 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-15 10:58:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:26,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:26,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:26,323 INFO L478 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 43 treesize of output 39 [2019-02-15 10:58:26,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,338 INFO L478 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 36 treesize of output 49 [2019-02-15 10:58:26,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:58:26,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:58:26,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,461 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,509 INFO L478 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-15 10:58:26,513 INFO L478 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-15 10:58:26,517 INFO L478 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-15 10:58:26,552 INFO L478 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-15 10:58:26,578 INFO L478 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-15 10:58:26,586 INFO L478 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-15 10:58:26,586 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,608 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,625 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,638 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,649 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,660 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,688 INFO L267 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-15 10:58:26,688 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 10:58:26,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,728 INFO L478 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 68 [2019-02-15 10:58:26,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,753 INFO L267 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-15 10:58:26,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:58:26,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:26,783 INFO L478 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 74 [2019-02-15 10:58:26,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:26,810 INFO L267 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-15 10:58:26,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-15 10:58:26,830 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-15 10:58:26,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:26,852 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-15 10:58:26,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:26,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:26,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:26,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:26,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:26,873 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-02-15 10:58:27,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:27,159 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-02-15 10:58:27,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:27,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:58:27,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:27,162 INFO L225 Difference]: With dead ends: 210 [2019-02-15 10:58:27,162 INFO L226 Difference]: Without dead ends: 208 [2019-02-15 10:58:27,162 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-15 10:58:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-15 10:58:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-02-15 10:58:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-02-15 10:58:27,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-02-15 10:58:27,207 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-02-15 10:58:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:27,207 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-02-15 10:58:27,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-02-15 10:58:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:27,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:27,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:27,209 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:27,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:27,209 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-02-15 10:58:27,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:27,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:27,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:27,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:27,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:27,301 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-15 10:58:27,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:27,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:27,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:58:27,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:58:27,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:27,302 INFO 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-15 10:58:27,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:58:27,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:58:27,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:58:27,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:58:27,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:27,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:27,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:27,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,428 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:27,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,485 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:27,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:27,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:27,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:27,585 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:27,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:27,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:27,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:27,714 INFO L478 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-15 10:58:27,717 INFO L478 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-15 10:58:27,720 INFO L478 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-15 10:58:27,723 INFO L478 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-15 10:58:27,726 INFO L478 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-15 10:58:27,733 INFO L478 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-15 10:58:27,734 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,115 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,134 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,149 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,162 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,173 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,215 INFO L267 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-15 10:58:28,216 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:28,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,250 INFO L478 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 97 [2019-02-15 10:58:28,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,292 INFO L267 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-15 10:58:28,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:28,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,330 INFO L478 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 111 [2019-02-15 10:58:28,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,376 INFO L267 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-15 10:58:28,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 10:58:28,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:28,412 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:28,413 INFO L478 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 124 [2019-02-15 10:58:28,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:28,463 INFO L267 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-15 10:58:28,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:58:28,487 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-15 10:58:28,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:28,523 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-15 10:58:28,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:28,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:28,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:28,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:28,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:28,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:28,543 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-02-15 10:58:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:31,198 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-02-15 10:58:31,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:31,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:31,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:31,201 INFO L225 Difference]: With dead ends: 242 [2019-02-15 10:58:31,202 INFO L226 Difference]: Without dead ends: 240 [2019-02-15 10:58:31,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:58:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-02-15 10:58:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-02-15 10:58:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-15 10:58:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-02-15 10:58:31,233 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-02-15 10:58:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:31,233 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-02-15 10:58:31,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:31,234 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-02-15 10:58:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:31,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:31,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:31,235 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:31,235 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-02-15 10:58:31,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:31,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:58:31,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:31,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:31,374 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-15 10:58:31,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:31,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:31,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:31,375 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-02-15 10:58:31,376 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:31,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:31,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:31,379 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:31,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:31,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:31,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:31,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 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-15 10:58:31,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:31,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:31,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:31,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:58:31,427 INFO L478 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-15 10:58:31,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,436 INFO L478 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-15 10:58:31,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,442 INFO L478 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-15 10:58:31,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,451 INFO L478 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-15 10:58:31,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,461 INFO L478 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-15 10:58:31,462 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,500 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,554 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:31,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:31,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,682 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:31,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,735 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:31,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:31,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:31,804 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,829 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,853 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,878 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,934 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:31,978 INFO L267 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-15 10:58:31,978 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:32,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,009 INFO L478 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 97 [2019-02-15 10:58:32,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,053 INFO L267 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-15 10:58:32,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:32,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,085 INFO L478 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 111 [2019-02-15 10:58:32,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,132 INFO L267 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-15 10:58:32,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-02-15 10:58:32,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:32,171 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:32,172 INFO L478 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 134 [2019-02-15 10:58:32,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:32,225 INFO L267 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-15 10:58:32,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:58:32,261 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-15 10:58:32,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:32,299 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-15 10:58:32,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:32,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:32,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:32,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:32,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:32,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:32,318 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-02-15 10:58:32,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:32,898 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-02-15 10:58:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:32,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:32,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:32,901 INFO L225 Difference]: With dead ends: 249 [2019-02-15 10:58:32,901 INFO L226 Difference]: Without dead ends: 247 [2019-02-15 10:58:32,901 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-15 10:58:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-02-15 10:58:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-02-15 10:58:32,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-02-15 10:58:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-02-15 10:58:32,943 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-02-15 10:58:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:32,944 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-02-15 10:58:32,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-02-15 10:58:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:32,944 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:32,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:32,945 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:32,945 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-02-15 10:58:32,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:32,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:32,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:32,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:32,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:33,043 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-15 10:58:33,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:33,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:33,043 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:33,043 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-02-15 10:58:33,046 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:33,046 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:33,048 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:33,049 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:33,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:33,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:33,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:33,049 INFO 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-15 10:58:33,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:33,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:33,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:33,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:58:33,084 INFO L478 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-15 10:58:33,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,089 INFO L478 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-15 10:58:33,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,096 INFO L478 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-15 10:58:33,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,102 INFO L478 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-15 10:58:33,110 INFO L478 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-15 10:58:33,110 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,138 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,159 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,190 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:33,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:33,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,300 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:33,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:33,348 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,364 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,379 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,394 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,425 INFO L267 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-15 10:58:33,425 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:33,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,480 INFO L478 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 72 [2019-02-15 10:58:33,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,508 INFO L267 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-15 10:58:33,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:33,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,539 INFO L478 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 86 [2019-02-15 10:58:33,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,571 INFO L267 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-15 10:58:33,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 10:58:33,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:33,607 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:33,608 INFO L478 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 98 [2019-02-15 10:58:33,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:33,641 INFO L267 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-15 10:58:33,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 10:58:33,662 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-15 10:58:33,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:33,701 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-15 10:58:33,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:33,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:33,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:33,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:33,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:33,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:33,720 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-02-15 10:58:34,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:34,247 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-02-15 10:58:34,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:34,247 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:34,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:34,251 INFO L225 Difference]: With dead ends: 260 [2019-02-15 10:58:34,251 INFO L226 Difference]: Without dead ends: 258 [2019-02-15 10:58:34,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:58:34,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-02-15 10:58:34,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-02-15 10:58:34,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-15 10:58:34,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-15 10:58:34,285 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-15 10:58:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:34,285 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-15 10:58:34,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-15 10:58:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:34,285 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:34,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:34,286 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-02-15 10:58:34,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:34,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:34,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:34,368 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-15 10:58:34,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:34,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:34,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:34,369 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-02-15 10:58:34,369 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:34,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:34,371 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:34,372 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:34,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:34,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:34,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:34,372 INFO 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-15 10:58:34,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:34,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:34,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:34,414 INFO L478 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-15 10:58:34,428 INFO L478 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-15 10:58:34,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,433 INFO L478 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-15 10:58:34,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,440 INFO L478 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-15 10:58:34,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,449 INFO L478 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-15 10:58:34,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,459 INFO L478 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-15 10:58:34,459 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,517 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,605 INFO L478 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 63 treesize of output 56 [2019-02-15 10:58:34,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,624 INFO L478 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 53 treesize of output 63 [2019-02-15 10:58:34,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 10:58:34,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,714 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 10:58:34,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 10:58:34,778 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,801 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,824 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,847 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,912 INFO L267 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-15 10:58:34,912 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 10:58:34,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:34,939 INFO L478 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 93 [2019-02-15 10:58:34,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:34,994 INFO L267 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-15 10:58:34,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 10:58:35,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,026 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:35,027 INFO L478 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 101 [2019-02-15 10:58:35,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,069 INFO L267 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-15 10:58:35,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-02-15 10:58:35,089 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-15 10:58:35,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:35,111 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-15 10:58:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:35,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:35,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:35,132 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-15 10:58:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:35,427 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-02-15 10:58:35,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:58:35,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:58:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:35,431 INFO L225 Difference]: With dead ends: 244 [2019-02-15 10:58:35,431 INFO L226 Difference]: Without dead ends: 243 [2019-02-15 10:58:35,431 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-15 10:58:35,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-15 10:58:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-02-15 10:58:35,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-15 10:58:35,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-02-15 10:58:35,477 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-02-15 10:58:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:35,477 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-02-15 10:58:35,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:35,478 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-02-15 10:58:35,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:35,479 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:35,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:35,479 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:35,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:35,479 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-02-15 10:58:35,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:35,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:35,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:35,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:35,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:35,589 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-15 10:58:35,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:35,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:35,590 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:35,590 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-02-15 10:58:35,590 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:35,591 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:35,592 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:35,593 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:35,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:35,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:35,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:35,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 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-15 10:58:35,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:35,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:35,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:35,613 INFO L478 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-15 10:58:35,617 INFO L478 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-15 10:58:35,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,624 INFO L478 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-15 10:58:35,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,633 INFO L478 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-15 10:58:35,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,641 INFO L478 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-15 10:58:35,650 INFO L478 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-15 10:58:35,650 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,678 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,757 INFO L478 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 43 treesize of output 39 [2019-02-15 10:58:35,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,773 INFO L478 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 36 treesize of output 49 [2019-02-15 10:58:35,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:58:35,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:35,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:58:35,849 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,861 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,890 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:35,919 INFO L267 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-15 10:58:35,919 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 10:58:36,100 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-15 10:58:36,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,154 INFO L478 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-15 10:58:36,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-15 10:58:36,493 INFO L267 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-15 10:58:36,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:349 [2019-02-15 10:58:36,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,605 INFO L478 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 63 [2019-02-15 10:58:36,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:36,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,696 INFO L478 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 58 treesize of output 92 [2019-02-15 10:58:36,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:36,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:36,780 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:36,781 INFO L478 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 72 [2019-02-15 10:58:36,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:36,838 INFO L267 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-15 10:58:36,838 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:162, output treesize:126 [2019-02-15 10:58:36,938 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-15 10:58:36,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:36,976 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-15 10:58:36,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:36,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:36,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:36,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:36,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:36,995 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-02-15 10:58:37,379 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-15 10:58:41,804 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-02-15 10:58:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:54,482 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-02-15 10:58:54,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:58:54,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:58:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:54,486 INFO L225 Difference]: With dead ends: 273 [2019-02-15 10:58:54,486 INFO L226 Difference]: Without dead ends: 272 [2019-02-15 10:58:54,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=79, Invalid=128, Unknown=3, NotChecked=0, Total=210 [2019-02-15 10:58:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-15 10:58:54,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-02-15 10:58:54,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-02-15 10:58:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-02-15 10:58:54,523 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-02-15 10:58:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:54,523 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-02-15 10:58:54,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:58:54,523 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-02-15 10:58:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:54,524 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:54,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:54,524 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:54,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:54,524 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-02-15 10:58:54,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:54,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:54,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:54,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:54,586 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-15 10:58:54,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:54,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:54,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:58:54,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:58:54,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:54,587 INFO 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-15 10:58:54,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:58:54,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:58:54,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:58:54,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:58:54,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:54,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:58:54,637 INFO L478 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-15 10:58:54,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,644 INFO L478 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-15 10:58:54,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,653 INFO L478 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-15 10:58:54,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,665 INFO L478 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-15 10:58:54,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,673 INFO L478 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-15 10:58:54,674 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:54,713 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:54,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:54,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:54,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:54,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:54,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:54,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,893 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:54,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:54,948 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:55,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:55,017 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,042 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,066 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,091 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,115 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,159 INFO L267 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-15 10:58:55,159 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:55,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,188 INFO L478 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 97 [2019-02-15 10:58:55,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,258 INFO L267 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-15 10:58:55,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:55,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,290 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:55,291 INFO L478 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 112 [2019-02-15 10:58:55,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,336 INFO L267 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-15 10:58:55,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-02-15 10:58:55,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:55,371 INFO L478 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 115 [2019-02-15 10:58:55,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:55,417 INFO L267 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-15 10:58:55,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-15 10:58:55,438 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-15 10:58:55,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:55,461 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-15 10:58:55,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:55,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:58:55,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:55,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:58:55,481 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-02-15 10:58:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:56,203 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-02-15 10:58:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:58:56,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:56,208 INFO L225 Difference]: With dead ends: 274 [2019-02-15 10:58:56,208 INFO L226 Difference]: Without dead ends: 273 [2019-02-15 10:58:56,208 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-15 10:58:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-02-15 10:58:56,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-02-15 10:58:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 10:58:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-15 10:58:56,244 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-15 10:58:56,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:56,245 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-15 10:58:56,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-15 10:58:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:56,245 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:56,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:56,246 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-02-15 10:58:56,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:56,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:56,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:58:56,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:56,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:56,280 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-15 10:58:56,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:56,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:56,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:56,281 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-02-15 10:58:56,282 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:56,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:56,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:56,286 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:58:56,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:56,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:56,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:56,287 INFO 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-15 10:58:56,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:56,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:56,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:56,303 INFO L478 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 63 treesize of output 56 [2019-02-15 10:58:56,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,324 INFO L478 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 53 treesize of output 63 [2019-02-15 10:58:56,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 10:58:56,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,419 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 10:58:56,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 10:58:56,482 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,505 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,528 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,610 INFO L478 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-15 10:58:56,613 INFO L478 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-15 10:58:56,617 INFO L478 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-15 10:58:56,621 INFO L478 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-15 10:58:56,623 INFO L478 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-15 10:58:56,627 INFO L478 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-15 10:58:56,627 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,659 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,677 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,690 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,700 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,712 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,752 INFO L267 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-15 10:58:56,752 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-15 10:58:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:56,773 INFO L478 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 93 [2019-02-15 10:58:56,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:56,814 INFO L267 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-15 10:58:56,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-02-15 10:58:56,832 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-15 10:58:56,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:56,841 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-15 10:58:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:56,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:58:56,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:56,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:58:56,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:58:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:58:56,861 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-02-15 10:58:57,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:57,070 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-02-15 10:58:57,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:58:57,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-02-15 10:58:57,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:57,074 INFO L225 Difference]: With dead ends: 242 [2019-02-15 10:58:57,074 INFO L226 Difference]: Without dead ends: 241 [2019-02-15 10:58:57,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-15 10:58:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-02-15 10:58:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-02-15 10:58:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-15 10:58:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-02-15 10:58:57,112 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-02-15 10:58:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:57,112 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-02-15 10:58:57,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:58:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-02-15 10:58:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:57,113 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:57,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:57,114 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:57,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-02-15 10:58:57,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:57,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:57,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:57,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:57,406 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-02-15 10:58:57,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-15 10:58:57,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:57,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:57,440 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:57,440 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-02-15 10:58:57,440 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:57,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:57,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:57,442 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:58:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:57,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:57,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:57,443 INFO 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-15 10:58:57,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:57,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:57,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:57,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:58:57,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:58:57,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,561 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:58:57,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,614 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:58:57,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:57,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:58:57,683 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,732 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,817 INFO L478 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-15 10:58:57,819 INFO L478 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-15 10:58:57,823 INFO L478 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-15 10:58:57,826 INFO L478 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-15 10:58:57,829 INFO L478 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-15 10:58:57,832 INFO L478 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-15 10:58:57,833 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,875 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,893 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,908 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,920 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,931 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:57,974 INFO L267 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-15 10:58:57,974 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:58:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,008 INFO L478 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 97 [2019-02-15 10:58:58,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:58,051 INFO L267 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-15 10:58:58,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:58:58,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,085 INFO L478 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 113 [2019-02-15 10:58:58,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:58,131 INFO L267 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-15 10:58:58,131 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:58:58,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:58,173 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:58:58,173 INFO L478 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 128 [2019-02-15 10:58:58,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:58,221 INFO L267 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-15 10:58:58,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-02-15 10:58:58,243 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-15 10:58:58,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:58,279 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-15 10:58:58,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:58,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:58:58,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:58,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:58:58,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:58:58,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:58:58,297 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-02-15 10:58:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:58:58,898 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-02-15 10:58:58,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:58:58,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-15 10:58:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:58:58,902 INFO L225 Difference]: With dead ends: 276 [2019-02-15 10:58:58,902 INFO L226 Difference]: Without dead ends: 274 [2019-02-15 10:58:58,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:58:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-02-15 10:58:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-02-15 10:58:58,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-15 10:58:58,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-02-15 10:58:58,947 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-02-15 10:58:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:58:58,948 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-02-15 10:58:58,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:58:58,948 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-02-15 10:58:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:58:58,948 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:58:58,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:58:58,949 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:58:58,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-02-15 10:58:58,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:58:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:58,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:58,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:58:58,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:58:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:59,020 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-15 10:58:59,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:59,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:58:59,021 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:58:59,021 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-02-15 10:58:59,021 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:58:59,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:58:59,024 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:58:59,024 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:58:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:58:59,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:58:59,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:58:59,025 INFO 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-15 10:58:59,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:58:59,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:58:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:58:59,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:58:59,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:58:59,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:58:59,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,136 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:58:59,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:58:59,180 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,250 INFO L478 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-15 10:58:59,252 INFO L478 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-15 10:58:59,255 INFO L478 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-15 10:58:59,258 INFO L478 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-15 10:58:59,261 INFO L478 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-15 10:58:59,269 INFO L478 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-15 10:58:59,270 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,294 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,313 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,326 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,339 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,350 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,380 INFO L267 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-15 10:58:59,381 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 10:58:59,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,410 INFO L478 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 72 [2019-02-15 10:58:59,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,439 INFO L267 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-15 10:58:59,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:58:59,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:58:59,640 INFO L303 Elim1Store]: Index analysis took 183 ms [2019-02-15 10:58:59,641 INFO L478 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 88 [2019-02-15 10:58:59,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:58:59,882 INFO L267 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-15 10:58:59,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-15 10:58:59,897 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-15 10:58:59,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:58:59,915 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-15 10:58:59,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:58:59,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:58:59,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:58:59,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:58:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:58:59,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:58:59,935 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-02-15 10:59:00,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:00,312 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-02-15 10:59:00,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:00,312 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:00,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:00,315 INFO L225 Difference]: With dead ends: 288 [2019-02-15 10:59:00,315 INFO L226 Difference]: Without dead ends: 287 [2019-02-15 10:59:00,316 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-15 10:59:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-15 10:59:00,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-02-15 10:59:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-02-15 10:59:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-02-15 10:59:00,380 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-02-15 10:59:00,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:00,381 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-02-15 10:59:00,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-02-15 10:59:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-15 10:59:00,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:00,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-15 10:59:00,382 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:00,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:00,382 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-02-15 10:59:00,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:00,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:00,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:00,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:00,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:00,453 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-15 10:59:00,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:00,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:00,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-15 10:59:00,454 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-02-15 10:59:00,455 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:00,455 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:00,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:00,457 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:00,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:00,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:00,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:00,458 INFO 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-15 10:59:00,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:00,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:00,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:00,478 INFO L478 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-15 10:59:00,481 INFO L478 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-15 10:59:00,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,495 INFO L478 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-15 10:59:00,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,503 INFO L478 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-15 10:59:00,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,513 INFO L478 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-15 10:59:00,522 INFO L478 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-15 10:59:00,523 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,547 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,627 INFO L478 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 43 treesize of output 39 [2019-02-15 10:59:00,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,642 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:00,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:59:00,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:59:00,718 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,746 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,761 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,789 INFO L267 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-15 10:59:00,790 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 10:59:00,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,826 INFO L478 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 72 [2019-02-15 10:59:00,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:00,914 INFO L267 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-15 10:59:00,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-15 10:59:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:00,948 INFO L478 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 67 [2019-02-15 10:59:00,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:00,967 INFO L267 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-15 10:59:00,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-02-15 10:59:00,981 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-15 10:59:00,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:00,994 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-15 10:59:01,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:01,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:59:01,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:01,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:01,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:01,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:59:01,013 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-02-15 10:59:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:01,404 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-02-15 10:59:01,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:59:01,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-15 10:59:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:01,408 INFO L225 Difference]: With dead ends: 319 [2019-02-15 10:59:01,409 INFO L226 Difference]: Without dead ends: 318 [2019-02-15 10:59:01,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-02-15 10:59:01,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-02-15 10:59:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-15 10:59:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-15 10:59:01,467 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-02-15 10:59:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:01,467 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-15 10:59:01,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-15 10:59:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:01,468 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:01,468 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:59:01,468 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:01,469 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-02-15 10:59:01,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:01,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:01,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:01,642 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-15 10:59:01,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:01,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:01,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:01,642 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-02-15 10:59:01,643 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:01,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:01,645 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:01,646 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:59:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:01,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:01,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:01,646 INFO 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-15 10:59:01,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:01,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:01,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:01,705 INFO L478 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 43 treesize of output 39 [2019-02-15 10:59:01,831 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-15 10:59:01,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,837 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:01,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:59:01,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:01,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:59:01,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:01,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,054 INFO L478 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-15 10:59:02,059 INFO L478 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-15 10:59:02,063 INFO L478 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-15 10:59:02,066 INFO L478 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-15 10:59:02,071 INFO L478 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-15 10:59:02,081 INFO L478 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-15 10:59:02,082 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,104 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,120 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,134 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,145 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,156 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,184 INFO L267 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-15 10:59:02,184 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 10:59:02,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,272 INFO L478 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-15 10:59:02,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,296 INFO L267 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-15 10:59:02,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:59:02,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,320 INFO L478 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 74 [2019-02-15 10:59:02,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,349 INFO L267 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-15 10:59:02,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-02-15 10:59:02,366 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-15 10:59:02,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:02,380 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-15 10:59:02,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:02,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 10:59:02,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:02,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 10:59:02,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 10:59:02,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:59:02,400 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-02-15 10:59:02,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:02,600 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-02-15 10:59:02,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:02,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-15 10:59:02,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:02,605 INFO L225 Difference]: With dead ends: 290 [2019-02-15 10:59:02,605 INFO L226 Difference]: Without dead ends: 289 [2019-02-15 10:59:02,605 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-15 10:59:02,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-15 10:59:02,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-02-15 10:59:02,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-15 10:59:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-02-15 10:59:02,679 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-02-15 10:59:02,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:02,679 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-02-15 10:59:02,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 10:59:02,679 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-02-15 10:59:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:02,680 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:02,680 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-15 10:59:02,681 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-02-15 10:59:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:02,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:02,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:02,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:02,753 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-15 10:59:02,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:02,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:02,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:02,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:02,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:02,753 INFO 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-15 10:59:02,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:59:02,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:59:02,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:59:02,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:02,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:02,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:02,789 INFO L478 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-15 10:59:02,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,797 INFO L478 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-15 10:59:02,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,803 INFO L478 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-15 10:59:02,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,812 INFO L478 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-15 10:59:02,828 INFO L478 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-15 10:59:02,829 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,877 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:02,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:02,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:02,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:03,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,014 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:03,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:59:03,068 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,083 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,098 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,113 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,144 INFO L267 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-15 10:59:03,144 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-02-15 10:59:03,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,176 INFO L478 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-15 10:59:03,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,203 INFO L267 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-15 10:59:03,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:59:03,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,231 INFO L478 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 88 [2019-02-15 10:59:03,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,264 INFO L267 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-15 10:59:03,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 10:59:03,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,294 INFO L478 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 98 [2019-02-15 10:59:03,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,330 INFO L267 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-15 10:59:03,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-02-15 10:59:03,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:03,363 INFO L478 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 98 [2019-02-15 10:59:03,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:03,400 INFO L267 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-15 10:59:03,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-02-15 10:59:03,419 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-15 10:59:03,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:03,449 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-15 10:59:03,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:03,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 10:59:03,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:03,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:59:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:59:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:59:03,467 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-02-15 10:59:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:04,056 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-02-15 10:59:04,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:59:04,057 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:59:04,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:04,062 INFO L225 Difference]: With dead ends: 423 [2019-02-15 10:59:04,063 INFO L226 Difference]: Without dead ends: 421 [2019-02-15 10:59:04,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-02-15 10:59:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-02-15 10:59:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-02-15 10:59:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-02-15 10:59:04,189 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-02-15 10:59:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:04,190 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-02-15 10:59:04,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:59:04,190 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-02-15 10:59:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:04,192 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:04,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:04,192 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-02-15 10:59:04,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:04,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:04,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:59:04,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:04,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:04,346 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:59:04,627 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-15 10:59:04,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:04,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:04,628 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:04,628 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-02-15 10:59:04,628 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:04,628 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:04,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:04,630 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:04,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:04,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:04,632 INFO 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-15 10:59:04,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:04,640 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:04,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:04,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:04,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:04,668 INFO L478 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-15 10:59:04,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,673 INFO L478 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-15 10:59:04,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,682 INFO L478 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-15 10:59:04,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,689 INFO L478 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-15 10:59:04,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,697 INFO L478 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-15 10:59:04,698 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:04,736 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:04,757 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:04,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:04,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:04,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:04,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:04,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:04,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,949 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:04,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:04,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,003 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:05,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:05,072 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,107 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,130 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,154 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,179 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,223 INFO L267 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-15 10:59:05,223 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:05,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,253 INFO L478 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-15 10:59:05,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,294 INFO L267 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-15 10:59:05,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:05,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,326 INFO L478 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 113 [2019-02-15 10:59:05,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,373 INFO L267 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-15 10:59:05,374 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:59:05,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:05,413 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:05,414 INFO L478 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 119 [2019-02-15 10:59:05,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:05,463 INFO L267 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-15 10:59:05,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 10:59:05,486 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-15 10:59:05,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:05,624 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-15 10:59:05,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:05,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:05,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:05,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:05,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:05,644 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-02-15 10:59:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:06,288 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-02-15 10:59:06,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:06,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:06,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:06,293 INFO L225 Difference]: With dead ends: 368 [2019-02-15 10:59:06,294 INFO L226 Difference]: Without dead ends: 366 [2019-02-15 10:59:06,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-15 10:59:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-02-15 10:59:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-02-15 10:59:06,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-02-15 10:59:06,360 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-02-15 10:59:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:06,360 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-02-15 10:59:06,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-02-15 10:59:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:06,362 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:06,362 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:59:06,362 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-02-15 10:59:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:06,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:06,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:06,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:06,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:06,503 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-15 10:59:06,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:06,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:06,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:06,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:06,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:06,504 INFO 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-15 10:59:06,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:59:06,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:59:06,520 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:59:06,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:06,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:06,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:06,550 INFO L478 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-15 10:59:06,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,556 INFO L478 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-15 10:59:06,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,562 INFO L478 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-15 10:59:06,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,646 INFO L478 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-15 10:59:06,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,654 INFO L478 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-15 10:59:06,655 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,693 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,715 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,747 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:06,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:06,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:06,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,869 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:06,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,923 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:06,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:06,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:06,991 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,015 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,039 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,064 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,088 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,131 INFO L267 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-15 10:59:07,132 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:07,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,160 INFO L478 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-15 10:59:07,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,201 INFO L267 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-15 10:59:07,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:07,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,233 INFO L478 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 113 [2019-02-15 10:59:07,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,279 INFO L267 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-15 10:59:07,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 10:59:07,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,314 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:07,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,315 INFO L478 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 122 [2019-02-15 10:59:07,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,376 INFO L267 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-15 10:59:07,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 10:59:07,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:07,418 INFO L478 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 135 [2019-02-15 10:59:07,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:07,472 INFO L267 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-15 10:59:07,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-02-15 10:59:07,494 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-15 10:59:07,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:07,536 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-15 10:59:07,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:07,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:59:07,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:07,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:59:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:59:07,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:07,555 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-02-15 10:59:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:08,306 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-02-15 10:59:08,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:59:08,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:59:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:08,311 INFO L225 Difference]: With dead ends: 407 [2019-02-15 10:59:08,312 INFO L226 Difference]: Without dead ends: 401 [2019-02-15 10:59:08,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:59:08,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-02-15 10:59:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-02-15 10:59:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-02-15 10:59:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-02-15 10:59:08,387 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-02-15 10:59:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:08,387 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-02-15 10:59:08,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:59:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-02-15 10:59:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:08,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:08,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:08,388 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:08,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-02-15 10:59:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:08,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:59:08,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:08,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:08,519 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-15 10:59:08,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:08,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:08,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:08,520 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-02-15 10:59:08,521 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:08,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:08,522 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:08,523 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:59:08,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:08,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:08,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:08,523 INFO 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-15 10:59:08,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:08,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:08,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:08,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:08,569 INFO L478 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-15 10:59:08,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,573 INFO L478 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-15 10:59:08,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,629 INFO L478 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-15 10:59:08,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,636 INFO L478 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-15 10:59:08,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,645 INFO L478 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-15 10:59:08,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:08,682 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:08,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:08,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:08,735 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:08,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:08,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:08,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:08,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,859 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:08,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,913 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:08,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:08,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:08,983 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,007 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,031 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,055 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,080 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,123 INFO L267 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-15 10:59:09,124 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:09,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,159 INFO L478 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-15 10:59:09,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,200 INFO L267 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-15 10:59:09,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:09,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,235 INFO L478 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 113 [2019-02-15 10:59:09,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,282 INFO L267 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-15 10:59:09,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 10:59:09,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,320 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:09,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,322 INFO L478 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 122 [2019-02-15 10:59:09,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,372 INFO L267 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-15 10:59:09,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 10:59:09,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,410 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:09,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:09,412 INFO L478 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 124 [2019-02-15 10:59:09,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:09,460 INFO L267 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-15 10:59:09,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 10:59:09,484 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-15 10:59:09,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:09,543 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-15 10:59:09,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:09,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:59:09,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:09,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:59:09,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:59:09,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:09,563 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-02-15 10:59:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:10,578 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-02-15 10:59:10,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 10:59:10,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:59:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:10,585 INFO L225 Difference]: With dead ends: 645 [2019-02-15 10:59:10,585 INFO L226 Difference]: Without dead ends: 643 [2019-02-15 10:59:10,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-02-15 10:59:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-02-15 10:59:10,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-02-15 10:59:10,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-02-15 10:59:10,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-02-15 10:59:10,688 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-02-15 10:59:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:10,688 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-02-15 10:59:10,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:59:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-02-15 10:59:10,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:10,690 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:10,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:10,690 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:10,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:10,690 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-02-15 10:59:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:10,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:10,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:10,770 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-15 10:59:10,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:10,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:10,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:10,771 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-02-15 10:59:10,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:10,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:10,773 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:10,773 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:10,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:10,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:10,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:10,774 INFO 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-15 10:59:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:10,784 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:10,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:10,797 INFO L478 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-15 10:59:10,800 INFO L478 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-15 10:59:10,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,807 INFO L478 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-15 10:59:10,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,817 INFO L478 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-15 10:59:10,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,824 INFO L478 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-15 10:59:10,835 INFO L478 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-15 10:59:10,836 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:10,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:10,880 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:10,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:10,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:10,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:10,942 INFO L478 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 43 treesize of output 39 [2019-02-15 10:59:10,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,958 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:10,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:10,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:59:11,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:59:11,039 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:11,052 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:11,065 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:11,080 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:11,109 INFO L267 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-15 10:59:11,109 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 10:59:11,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,199 INFO L478 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-15 10:59:11,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:11,223 INFO L267 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-15 10:59:11,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:59:11,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:11,261 INFO L478 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 88 [2019-02-15 10:59:11,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:11,355 INFO L267 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-15 10:59:11,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-02-15 10:59:11,392 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-15 10:59:11,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:11,410 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-15 10:59:11,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:11,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 10:59:11,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:11,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:59:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:59:11,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:11,430 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-02-15 10:59:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:11,968 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-02-15 10:59:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:59:11,968 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:59:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:11,974 INFO L225 Difference]: With dead ends: 527 [2019-02-15 10:59:11,975 INFO L226 Difference]: Without dead ends: 524 [2019-02-15 10:59:11,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-15 10:59:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-02-15 10:59:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-02-15 10:59:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-02-15 10:59:12,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-02-15 10:59:12,091 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-02-15 10:59:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:12,091 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-02-15 10:59:12,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:59:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-02-15 10:59:12,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:12,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:12,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:12,092 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:12,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:12,093 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-02-15 10:59:12,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:12,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:12,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:12,248 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:59:12,272 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-15 10:59:12,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:12,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:12,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:12,273 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-02-15 10:59:12,274 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:12,274 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:12,276 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:12,276 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:12,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:12,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:12,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:12,276 INFO 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-15 10:59:12,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:12,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:12,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:12,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:12,312 INFO L478 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-15 10:59:12,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,319 INFO L478 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-15 10:59:12,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,324 INFO L478 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-15 10:59:12,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,340 INFO L478 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-15 10:59:12,348 INFO L478 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-15 10:59:12,349 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,375 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,396 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:12,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:12,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,531 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:12,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:59:12,578 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,593 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,623 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,654 INFO L267 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-15 10:59:12,654 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 10:59:12,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,702 INFO L478 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-15 10:59:12,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,731 INFO L267 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-15 10:59:12,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:59:12,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,761 INFO L478 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 88 [2019-02-15 10:59:12,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,794 INFO L267 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-15 10:59:12,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-15 10:59:12,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:12,830 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:12,830 INFO L478 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 104 [2019-02-15 10:59:12,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:12,864 INFO L267 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-15 10:59:12,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 10:59:12,886 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-15 10:59:12,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:12,921 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-15 10:59:12,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:12,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:12,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:12,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:12,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:12,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:12,940 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-02-15 10:59:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:13,531 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-02-15 10:59:13,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:13,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:13,538 INFO L225 Difference]: With dead ends: 534 [2019-02-15 10:59:13,538 INFO L226 Difference]: Without dead ends: 533 [2019-02-15 10:59:13,539 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-15 10:59:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-02-15 10:59:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-02-15 10:59:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-02-15 10:59:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-02-15 10:59:13,672 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-02-15 10:59:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:13,672 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-02-15 10:59:13,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-02-15 10:59:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:13,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:13,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:13,673 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:13,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:13,674 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-02-15 10:59:13,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:13,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:13,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:13,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:13,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:13,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-15 10:59:13,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:13,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:13,770 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:13,770 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-02-15 10:59:13,771 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:13,772 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:13,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:13,774 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:13,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:13,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:13,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:13,775 INFO 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-15 10:59:13,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:13,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:13,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:13,790 INFO L478 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-15 10:59:13,793 INFO L478 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-15 10:59:13,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,800 INFO L478 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-15 10:59:13,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,808 INFO L478 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-15 10:59:13,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,819 INFO L478 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-15 10:59:13,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,829 INFO L478 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-15 10:59:13,829 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:13,864 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:13,882 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:13,898 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:13,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:13,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:13,948 INFO L478 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 63 treesize of output 56 [2019-02-15 10:59:13,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:13,965 INFO L478 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 53 treesize of output 63 [2019-02-15 10:59:14,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 10:59:14,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,057 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 10:59:14,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 10:59:14,121 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,144 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,166 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,189 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,213 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,254 INFO L267 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-15 10:59:14,254 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 10:59:14,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,321 INFO L478 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-15 10:59:14,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,359 INFO L267 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-15 10:59:14,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 10:59:14,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,393 INFO L478 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 101 [2019-02-15 10:59:14,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,432 INFO L267 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-15 10:59:14,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-15 10:59:14,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,469 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:14,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:14,471 INFO L478 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 114 [2019-02-15 10:59:14,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:14,515 INFO L267 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-15 10:59:14,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-02-15 10:59:14,538 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-15 10:59:14,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:14,577 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-15 10:59:14,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:14,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:14,596 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:14,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:14,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:14,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:14,596 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-02-15 10:59:15,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:15,185 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-02-15 10:59:15,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:15,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:15,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:15,191 INFO L225 Difference]: With dead ends: 543 [2019-02-15 10:59:15,191 INFO L226 Difference]: Without dead ends: 542 [2019-02-15 10:59:15,191 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-15 10:59:15,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-02-15 10:59:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-02-15 10:59:15,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-15 10:59:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-02-15 10:59:15,310 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-02-15 10:59:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:15,311 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-02-15 10:59:15,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-02-15 10:59:15,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:15,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:15,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:15,313 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:15,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:15,313 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-02-15 10:59:15,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:15,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:15,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:15,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:15,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:15,392 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:15,392 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-02-15 10:59:15,393 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:15,393 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:15,395 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:15,395 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:15,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:15,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:15,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:15,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:59:15,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:15,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:15,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:15,416 INFO L478 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-15 10:59:15,422 INFO L478 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-15 10:59:15,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,428 INFO L478 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-15 10:59:15,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,437 INFO L478 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-15 10:59:15,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,452 INFO L478 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-15 10:59:15,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,463 INFO L478 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-15 10:59:15,463 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,535 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,601 INFO L478 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 63 treesize of output 56 [2019-02-15 10:59:15,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,620 INFO L478 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 53 treesize of output 63 [2019-02-15 10:59:15,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 10:59:15,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,710 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 10:59:15,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 10:59:15,776 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,799 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,821 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,844 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,869 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,910 INFO L267 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-15 10:59:15,911 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 10:59:15,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:15,943 INFO L478 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-15 10:59:15,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:15,982 INFO L267 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-15 10:59:15,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 10:59:16,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,019 INFO L478 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 101 [2019-02-15 10:59:16,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:16,074 INFO L267 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-15 10:59:16,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-15 10:59:16,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,103 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:16,113 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:16,114 INFO L478 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 119 [2019-02-15 10:59:16,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:16,161 INFO L267 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-15 10:59:16,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-15 10:59:16,185 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-15 10:59:16,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:16,221 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-15 10:59:16,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:16,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:16,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:16,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:16,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:16,241 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-02-15 10:59:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:16,902 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-02-15 10:59:16,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:16,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:16,908 INFO L225 Difference]: With dead ends: 537 [2019-02-15 10:59:16,908 INFO L226 Difference]: Without dead ends: 536 [2019-02-15 10:59:16,908 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-15 10:59:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-02-15 10:59:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-02-15 10:59:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-02-15 10:59:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-02-15 10:59:17,038 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-02-15 10:59:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:17,038 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-02-15 10:59:17,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:17,038 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-02-15 10:59:17,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:17,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:17,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:17,039 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:17,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-02-15 10:59:17,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:17,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:17,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:17,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:17,450 WARN L181 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-15 10:59:17,591 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-15 10:59:17,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:17,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:17,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:17,592 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-02-15 10:59:17,592 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:17,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:17,596 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:17,596 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:17,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:17,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:17,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:17,596 INFO 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-15 10:59:17,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:17,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:17,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:17,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:17,734 INFO L478 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-15 10:59:17,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,739 INFO L478 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-15 10:59:17,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,745 INFO L478 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-15 10:59:17,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,752 INFO L478 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-15 10:59:17,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,761 INFO L478 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-15 10:59:17,761 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,811 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:17,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:17,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:17,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:17,992 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:18,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,046 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:18,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:18,125 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,149 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,173 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,196 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,220 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,263 INFO L267 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-15 10:59:18,263 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:18,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,296 INFO L478 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-15 10:59:18,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,412 INFO L267 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-15 10:59:18,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:18,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,445 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:18,445 INFO L478 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 106 [2019-02-15 10:59:18,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,489 INFO L267 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-15 10:59:18,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-02-15 10:59:18,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:18,523 INFO L478 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 115 [2019-02-15 10:59:18,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:18,568 INFO L267 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-15 10:59:18,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-02-15 10:59:18,591 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-15 10:59:18,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:18,633 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-15 10:59:18,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:18,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:18,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:18,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:18,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:18,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:18,653 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-02-15 10:59:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:19,327 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-02-15 10:59:19,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:19,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:19,331 INFO L225 Difference]: With dead ends: 588 [2019-02-15 10:59:19,331 INFO L226 Difference]: Without dead ends: 587 [2019-02-15 10:59:19,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-02-15 10:59:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-02-15 10:59:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-02-15 10:59:19,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-02-15 10:59:19,458 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-02-15 10:59:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:19,458 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-02-15 10:59:19,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-02-15 10:59:19,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:19,459 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:19,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:19,459 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:19,460 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-02-15 10:59:19,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:19,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:19,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:19,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:19,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:19,510 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-15 10:59:19,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:19,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:19,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:19,511 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-02-15 10:59:19,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:19,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:19,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:19,514 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:19,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:19,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:19,514 INFO 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-15 10:59:19,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:19,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:19,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:19,537 INFO L478 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-15 10:59:19,540 INFO L478 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-15 10:59:19,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,546 INFO L478 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-15 10:59:19,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,555 INFO L478 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-15 10:59:19,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,564 INFO L478 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-15 10:59:19,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,573 INFO L478 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-15 10:59:19,574 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,610 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:19,695 INFO L478 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 63 treesize of output 56 [2019-02-15 10:59:19,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,713 INFO L478 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 53 treesize of output 63 [2019-02-15 10:59:19,857 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-02-15 10:59:19,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 10:59:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,914 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 10:59:19,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:19,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 10:59:19,980 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,001 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,024 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,046 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,071 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,111 INFO L267 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-15 10:59:20,111 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 10:59:20,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,138 INFO L478 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-15 10:59:20,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,177 INFO L267 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-15 10:59:20,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 10:59:20,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:20,208 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:20,209 INFO L478 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 102 [2019-02-15 10:59:20,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:20,250 INFO L267 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-15 10:59:20,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-02-15 10:59:20,273 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-15 10:59:20,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:20,310 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-15 10:59:20,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:20,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:59:20,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:20,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:20,330 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-02-15 10:59:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:20,794 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-02-15 10:59:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:59:20,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:59:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:20,798 INFO L225 Difference]: With dead ends: 558 [2019-02-15 10:59:20,798 INFO L226 Difference]: Without dead ends: 557 [2019-02-15 10:59:20,799 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-15 10:59:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-02-15 10:59:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-02-15 10:59:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-02-15 10:59:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-02-15 10:59:20,923 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-02-15 10:59:20,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:20,924 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-02-15 10:59:20,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:20,924 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-02-15 10:59:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:20,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:20,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:20,925 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:20,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-02-15 10:59:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:20,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:20,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:20,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:21,003 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-15 10:59:21,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:21,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:21,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:21,004 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-02-15 10:59:21,005 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:21,005 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:21,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:21,006 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:21,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:21,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:21,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:21,007 INFO 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-15 10:59:21,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:21,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:21,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:21,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:21,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:21,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,109 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:21,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:59:21,156 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,172 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,224 INFO L478 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-15 10:59:21,227 INFO L478 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-15 10:59:21,230 INFO L478 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-15 10:59:21,233 INFO L478 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-15 10:59:21,235 INFO L478 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-15 10:59:21,243 INFO L478 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-15 10:59:21,244 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,268 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,287 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,311 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,322 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,352 INFO L267 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-15 10:59:21,353 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:59:21,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,389 INFO L478 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-15 10:59:21,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,415 INFO L267 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-15 10:59:21,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:59:21,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,438 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:21,439 INFO L478 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 81 [2019-02-15 10:59:21,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,468 INFO L267 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-15 10:59:21,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-02-15 10:59:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:21,499 INFO L478 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 90 [2019-02-15 10:59:21,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:21,530 INFO L267 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-15 10:59:21,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-15 10:59:21,550 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-15 10:59:21,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:21,572 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-15 10:59:21,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:21,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 10:59:21,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:21,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:21,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:21,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:21,591 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-02-15 10:59:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:22,288 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-02-15 10:59:22,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:59:22,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:22,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:22,294 INFO L225 Difference]: With dead ends: 795 [2019-02-15 10:59:22,294 INFO L226 Difference]: Without dead ends: 794 [2019-02-15 10:59:22,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-02-15 10:59:22,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-02-15 10:59:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-02-15 10:59:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-02-15 10:59:22,442 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-02-15 10:59:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:22,442 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-02-15 10:59:22,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-02-15 10:59:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:22,444 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:22,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:22,444 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:22,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-02-15 10:59:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:22,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:22,445 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:22,566 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-15 10:59:22,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:22,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:22,567 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:22,567 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-02-15 10:59:22,568 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:22,568 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:22,570 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:22,570 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:22,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:22,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:22,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:22,570 INFO 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-15 10:59:22,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:22,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:22,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:22,595 INFO L478 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-15 10:59:22,599 INFO L478 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-15 10:59:22,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,608 INFO L478 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-15 10:59:22,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,614 INFO L478 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-15 10:59:22,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,624 INFO L478 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-15 10:59:22,631 INFO L478 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-15 10:59:22,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,738 INFO L478 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 43 treesize of output 39 [2019-02-15 10:59:22,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,754 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:22,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:59:22,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:59:22,831 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,845 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,859 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,874 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,902 INFO L267 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-15 10:59:22,902 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 10:59:22,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,944 INFO L478 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-15 10:59:22,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:22,969 INFO L267 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-15 10:59:22,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 10:59:22,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,994 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:22,998 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:23,006 INFO L478 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 81 [2019-02-15 10:59:23,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:23,092 INFO L267 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-15 10:59:23,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-02-15 10:59:23,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-15 10:59:23,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:23,220 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-15 10:59:23,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:23,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-15 10:59:23,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:23,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:59:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:59:23,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:59:23,239 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-02-15 10:59:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:24,001 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-02-15 10:59:24,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:59:24,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:59:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:24,004 INFO L225 Difference]: With dead ends: 539 [2019-02-15 10:59:24,004 INFO L226 Difference]: Without dead ends: 538 [2019-02-15 10:59:24,005 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-15 10:59:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-02-15 10:59:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-02-15 10:59:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-02-15 10:59:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-02-15 10:59:24,177 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-02-15 10:59:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:24,177 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-02-15 10:59:24,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:59:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-02-15 10:59:24,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:24,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:24,178 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:59:24,178 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-02-15 10:59:24,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:24,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:24,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:24,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:24,482 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-02-15 10:59:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 10:59:24,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:24,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:24,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:24,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:24,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:24,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:59:24,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:24,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:24,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:24,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:24,646 INFO L478 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-15 10:59:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,651 INFO L478 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-15 10:59:24,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,658 INFO L478 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-15 10:59:24,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,665 INFO L478 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-15 10:59:24,673 INFO L478 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-15 10:59:24,674 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,702 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,723 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:24,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:24,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,876 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:24,936 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:24,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:59:24,943 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,958 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,973 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:24,988 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,019 INFO L267 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-15 10:59:25,020 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:59:25,226 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-02-15 10:59:25,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,270 INFO L478 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 81 [2019-02-15 10:59:25,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:25,372 INFO L267 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-15 10:59:25,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-02-15 10:59:25,575 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-02-15 10:59:25,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,586 INFO L478 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 81 [2019-02-15 10:59:25,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:25,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:25,674 INFO L478 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 91 [2019-02-15 10:59:25,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:25,792 INFO L267 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-15 10:59:25,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-02-15 10:59:26,024 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-02-15 10:59:26,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,050 INFO L478 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 101 [2019-02-15 10:59:26,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:26,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,159 INFO L478 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 111 [2019-02-15 10:59:26,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:26,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,259 INFO L478 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 98 [2019-02-15 10:59:26,259 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:26,338 INFO L267 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-15 10:59:26,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-02-15 10:59:26,543 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-15 10:59:26,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,590 INFO L478 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 125 [2019-02-15 10:59:26,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 10:59:26,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:26,907 INFO L478 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 98 [2019-02-15 10:59:26,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,062 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:27,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:27,063 INFO L478 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 88 [2019-02-15 10:59:27,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:27,191 INFO L267 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-15 10:59:27,192 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-02-15 10:59:27,325 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-15 10:59:27,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:27,400 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-15 10:59:27,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:27,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:59:27,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:27,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:59:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:59:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:27,419 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-02-15 10:59:27,634 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-02-15 10:59:28,239 WARN L181 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-02-15 10:59:28,697 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-02-15 10:59:29,208 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-02-15 10:59:30,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:30,029 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-02-15 10:59:30,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:59:30,030 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:59:30,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:30,034 INFO L225 Difference]: With dead ends: 678 [2019-02-15 10:59:30,034 INFO L226 Difference]: Without dead ends: 673 [2019-02-15 10:59:30,035 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-15 10:59:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-02-15 10:59:30,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-02-15 10:59:30,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-02-15 10:59:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-02-15 10:59:30,275 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-02-15 10:59:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:30,275 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-02-15 10:59:30,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:59:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-02-15 10:59:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:30,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:30,277 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:59:30,277 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:30,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:30,277 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-02-15 10:59:30,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:30,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:30,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:30,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:30,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:30,339 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-15 10:59:30,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:30,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:30,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:30,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:30,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:30,340 INFO 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-15 10:59:30,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:59:30,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:59:30,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:59:30,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:30,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:30,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:30,386 INFO L478 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-15 10:59:30,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,391 INFO L478 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-15 10:59:30,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,398 INFO L478 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-15 10:59:30,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,407 INFO L478 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-15 10:59:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,415 INFO L478 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-15 10:59:30,416 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,455 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,476 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:30,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:30,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,646 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:30,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,700 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:30,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:30,769 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,793 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,817 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,842 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,867 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:30,910 INFO L267 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-15 10:59:30,911 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:30,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:30,977 INFO L478 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 97 [2019-02-15 10:59:30,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,039 INFO L267 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-15 10:59:31,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:31,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,071 INFO L478 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 103 [2019-02-15 10:59:31,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,117 INFO L267 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-15 10:59:31,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:31,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,153 INFO L478 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 123 [2019-02-15 10:59:31,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,205 INFO L267 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-15 10:59:31,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-02-15 10:59:31,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:31,252 INFO L478 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 135 [2019-02-15 10:59:31,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:31,306 INFO L267 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-15 10:59:31,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-02-15 10:59:31,332 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-15 10:59:31,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:31,379 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-15 10:59:31,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:31,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 10:59:31,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:31,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 10:59:31,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 10:59:31,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:31,399 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-02-15 10:59:32,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:32,242 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-02-15 10:59:32,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:59:32,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-02-15 10:59:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:32,247 INFO L225 Difference]: With dead ends: 704 [2019-02-15 10:59:32,247 INFO L226 Difference]: Without dead ends: 703 [2019-02-15 10:59:32,248 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-15 10:59:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-02-15 10:59:32,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-02-15 10:59:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-02-15 10:59:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-02-15 10:59:32,454 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-02-15 10:59:32,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:32,454 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-02-15 10:59:32,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 10:59:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-02-15 10:59:32,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:32,455 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:32,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:32,456 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:32,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-02-15 10:59:32,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:32,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:32,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:59:32,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:32,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:32,636 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-15 10:59:32,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:32,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:32,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:59:32,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:59:32,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:32,637 INFO 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-15 10:59:32,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:59:32,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:59:32,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:59:32,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:59:32,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:32,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:32,680 INFO L478 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-15 10:59:32,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,683 INFO L478 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-15 10:59:32,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,689 INFO L478 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-15 10:59:32,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,708 INFO L478 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-15 10:59:32,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,718 INFO L478 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-15 10:59:32,718 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,757 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,778 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:32,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:32,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:32,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,933 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:32,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:32,988 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:33,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:33,057 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,082 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,104 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,129 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,153 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,197 INFO L267 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-15 10:59:33,197 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:33,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,233 INFO L478 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 97 [2019-02-15 10:59:33,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,275 INFO L267 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-15 10:59:33,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:33,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,311 INFO L478 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 103 [2019-02-15 10:59:33,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,355 INFO L267 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-15 10:59:33,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,393 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:33,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,395 INFO L478 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 122 [2019-02-15 10:59:33,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,442 INFO L267 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-15 10:59:33,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 10:59:33,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,479 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:33,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:33,480 INFO L478 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 124 [2019-02-15 10:59:33,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:33,528 INFO L267 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-15 10:59:33,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 10:59:33,553 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-15 10:59:33,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:33,602 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-15 10:59:33,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:33,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:59:33,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:33,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:59:33,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:59:33,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:33,622 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-02-15 10:59:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:34,914 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-02-15 10:59:34,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:59:34,915 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:59:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:34,923 INFO L225 Difference]: With dead ends: 1218 [2019-02-15 10:59:34,923 INFO L226 Difference]: Without dead ends: 1217 [2019-02-15 10:59:34,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-02-15 10:59:34,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-02-15 10:59:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-02-15 10:59:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-02-15 10:59:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-02-15 10:59:35,307 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-02-15 10:59:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:35,307 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-02-15 10:59:35,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:59:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-02-15 10:59:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:35,308 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:35,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:35,308 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:35,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-02-15 10:59:35,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:35,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:35,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:59:35,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:35,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:35,397 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-15 10:59:35,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:35,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:35,398 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:35,398 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-02-15 10:59:35,399 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:35,399 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:35,402 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:35,402 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:35,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:35,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:35,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:35,402 INFO 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-15 10:59:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:35,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:35,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:35,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:35,455 INFO L478 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-15 10:59:35,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,459 INFO L478 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-15 10:59:35,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,466 INFO L478 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-15 10:59:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,474 INFO L478 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-15 10:59:35,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,484 INFO L478 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-15 10:59:35,484 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,546 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,565 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,580 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:35,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:35,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,724 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:35,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,778 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:35,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:35,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:35,847 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,872 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,896 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,920 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,945 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:35,988 INFO L267 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-15 10:59:35,988 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:36,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,020 INFO L478 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 97 [2019-02-15 10:59:36,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:36,063 INFO L267 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-15 10:59:36,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:36,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,100 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:36,100 INFO L478 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 105 [2019-02-15 10:59:36,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:36,145 INFO L267 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-15 10:59:36,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-02-15 10:59:36,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:36,182 INFO L478 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 111 [2019-02-15 10:59:36,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:36,227 INFO L267 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-15 10:59:36,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-02-15 10:59:36,251 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-15 10:59:36,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:36,290 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-15 10:59:36,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:36,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:36,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:36,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:36,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:36,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:36,308 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-02-15 10:59:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:37,117 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-02-15 10:59:37,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:37,118 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:37,123 INFO L225 Difference]: With dead ends: 814 [2019-02-15 10:59:37,124 INFO L226 Difference]: Without dead ends: 811 [2019-02-15 10:59:37,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-15 10:59:37,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-02-15 10:59:37,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-02-15 10:59:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-02-15 10:59:37,495 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-02-15 10:59:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:37,495 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-02-15 10:59:37,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-02-15 10:59:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:37,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:37,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:37,496 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:37,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:37,496 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-02-15 10:59:37,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:37,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:37,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:37,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:37,771 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-02-15 10:59:37,786 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-15 10:59:37,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:37,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:37,786 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:37,786 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-02-15 10:59:37,787 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:37,787 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:37,789 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:37,789 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:37,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:37,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:37,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:59:37,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:37,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:37,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:37,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:37,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:37,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,896 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:37,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:37,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:59:37,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,958 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:37,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,012 INFO L478 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-15 10:59:38,015 INFO L478 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-15 10:59:38,018 INFO L478 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-15 10:59:38,020 INFO L478 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-15 10:59:38,022 INFO L478 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-15 10:59:38,030 INFO L478 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-15 10:59:38,030 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,054 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,073 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,088 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,100 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,142 INFO L267 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-15 10:59:38,142 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 10:59:38,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,195 INFO L478 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 72 [2019-02-15 10:59:38,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,224 INFO L267 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-15 10:59:38,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 10:59:38,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,257 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:38,258 INFO L478 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 80 [2019-02-15 10:59:38,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,288 INFO L267 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-15 10:59:38,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 10:59:38,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:38,317 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:38,318 INFO L478 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 80 [2019-02-15 10:59:38,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:38,346 INFO L267 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-15 10:59:38,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-15 10:59:38,368 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-15 10:59:38,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:38,402 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-15 10:59:38,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-15 10:59:38,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:38,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-15 10:59:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-15 10:59:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-15 10:59:38,420 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-02-15 10:59:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:39,260 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-02-15 10:59:39,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:39,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-15 10:59:39,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:39,264 INFO L225 Difference]: With dead ends: 812 [2019-02-15 10:59:39,265 INFO L226 Difference]: Without dead ends: 811 [2019-02-15 10:59:39,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-02-15 10:59:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-02-15 10:59:39,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-02-15 10:59:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-02-15 10:59:39,570 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-02-15 10:59:39,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:39,571 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-02-15 10:59:39,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-15 10:59:39,571 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-02-15 10:59:39,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:39,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:39,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:39,572 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:39,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-02-15 10:59:39,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:39,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:39,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:39,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:39,678 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-15 10:59:39,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:39,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:39,679 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:39,679 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-02-15 10:59:39,680 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:39,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:39,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:39,682 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:39,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:39,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:39,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:39,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:59:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:39,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:39,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:39,714 INFO L478 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-15 10:59:39,723 INFO L478 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-15 10:59:39,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,727 INFO L478 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-15 10:59:39,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,735 INFO L478 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-15 10:59:39,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,745 INFO L478 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-15 10:59:39,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,754 INFO L478 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-15 10:59:39,754 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:39,791 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:39,811 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:39,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:39,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:39,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:39,875 INFO L478 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 63 treesize of output 56 [2019-02-15 10:59:39,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,893 INFO L478 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 53 treesize of output 63 [2019-02-15 10:59:39,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,932 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 10:59:39,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:39,984 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 10:59:40,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 10:59:40,047 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,070 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,092 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,115 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,139 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,180 INFO L267 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-15 10:59:40,180 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 10:59:40,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,213 INFO L478 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 97 [2019-02-15 10:59:40,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:40,350 INFO L267 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-15 10:59:40,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-15 10:59:40,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:40,474 INFO L478 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 86 [2019-02-15 10:59:40,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:40,505 INFO L267 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-15 10:59:40,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-02-15 10:59:40,525 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-15 10:59:40,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:40,541 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-15 10:59:40,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:40,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:59:40,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:40,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:40,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:40,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:59:40,560 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-02-15 10:59:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:41,223 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-02-15 10:59:41,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:41,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:59:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:41,226 INFO L225 Difference]: With dead ends: 843 [2019-02-15 10:59:41,226 INFO L226 Difference]: Without dead ends: 842 [2019-02-15 10:59:41,226 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-15 10:59:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-02-15 10:59:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-02-15 10:59:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-02-15 10:59:41,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-02-15 10:59:41,568 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-02-15 10:59:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:41,568 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-02-15 10:59:41,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-02-15 10:59:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:41,569 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:41,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:41,569 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:41,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:41,570 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-02-15 10:59:41,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:41,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:41,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:41,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:41,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:41,629 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-15 10:59:41,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:41,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:41,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:41,630 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-02-15 10:59:41,631 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:41,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:41,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:41,633 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:41,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:41,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:41,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:41,633 INFO 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-15 10:59:41,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:41,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:41,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:41,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:41,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:41,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,737 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:41,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:41,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:59:41,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,826 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,878 INFO L478 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-15 10:59:41,879 INFO L478 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-15 10:59:41,882 INFO L478 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-15 10:59:41,885 INFO L478 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-15 10:59:41,888 INFO L478 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-15 10:59:41,897 INFO L478 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-15 10:59:41,897 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,922 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,941 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,956 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,968 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:41,979 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:42,009 INFO L267 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-15 10:59:42,010 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 10:59:42,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,118 INFO L478 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 81 [2019-02-15 10:59:42,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:42,218 INFO L267 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-15 10:59:42,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-15 10:59:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:42,688 INFO L303 Elim1Store]: Index analysis took 371 ms [2019-02-15 10:59:42,779 INFO L478 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 103 [2019-02-15 10:59:42,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-15 10:59:43,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,084 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:43,084 INFO L478 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 88 [2019-02-15 10:59:43,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,237 INFO L267 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-15 10:59:43,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-02-15 10:59:43,391 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-02-15 10:59:43,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,398 INFO L478 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 88 [2019-02-15 10:59:43,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,528 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:43,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,529 INFO L478 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 100 [2019-02-15 10:59:43,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,656 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:43,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,658 INFO L478 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 94 [2019-02-15 10:59:43,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:43,777 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:43,778 INFO L478 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 98 [2019-02-15 10:59:43,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:43,876 INFO L267 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-15 10:59:43,876 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-02-15 10:59:43,988 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-15 10:59:43,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:44,044 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-15 10:59:44,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:44,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:44,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:44,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:44,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:44,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:44,063 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-02-15 10:59:44,245 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-02-15 10:59:44,521 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-15 10:59:44,943 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-02-15 10:59:45,643 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-02-15 10:59:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:45,931 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-02-15 10:59:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:59:45,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:45,935 INFO L225 Difference]: With dead ends: 896 [2019-02-15 10:59:45,935 INFO L226 Difference]: Without dead ends: 895 [2019-02-15 10:59:45,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-02-15 10:59:45,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-02-15 10:59:46,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-02-15 10:59:46,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-02-15 10:59:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-02-15 10:59:46,275 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-02-15 10:59:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:46,275 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-02-15 10:59:46,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-02-15 10:59:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:46,276 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:46,276 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:46,277 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:46,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:46,277 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-02-15 10:59:46,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:46,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:46,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:46,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:46,352 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-15 10:59:46,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:46,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:46,352 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:46,352 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-02-15 10:59:46,353 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:46,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:46,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:46,355 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 10:59:46,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:46,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:46,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:46,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:59:46,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:46,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:46,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:46,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 10:59:46,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 10:59:46,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,466 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 10:59:46,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 10:59:46,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,582 INFO L478 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-15 10:59:46,584 INFO L478 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-15 10:59:46,587 INFO L478 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-15 10:59:46,590 INFO L478 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-15 10:59:46,593 INFO L478 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-15 10:59:46,599 INFO L478 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-15 10:59:46,600 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,624 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,643 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,658 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,670 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,681 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,712 INFO L267 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-15 10:59:46,712 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-02-15 10:59:46,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,751 INFO L478 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 72 [2019-02-15 10:59:46,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,780 INFO L267 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-15 10:59:46,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-15 10:59:46,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,807 INFO L478 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 86 [2019-02-15 10:59:46,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:46,840 INFO L267 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-15 10:59:46,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-15 10:59:46,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:46,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:47,146 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:47,146 INFO L303 Elim1Store]: Index analysis took 290 ms [2019-02-15 10:59:47,147 INFO L478 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 98 [2019-02-15 10:59:47,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:47,327 INFO L267 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-15 10:59:47,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-15 10:59:47,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:47,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:47,379 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-15 10:59:47,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:47,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:59:47,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:47,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:59:47,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:59:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:47,400 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-02-15 10:59:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:48,345 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-02-15 10:59:48,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:59:48,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 10:59:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:48,349 INFO L225 Difference]: With dead ends: 975 [2019-02-15 10:59:48,349 INFO L226 Difference]: Without dead ends: 973 [2019-02-15 10:59:48,350 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-15 10:59:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-02-15 10:59:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-02-15 10:59:48,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-02-15 10:59:48,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-02-15 10:59:48,717 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-02-15 10:59:48,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:48,717 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-02-15 10:59:48,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:59:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-02-15 10:59:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:48,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:48,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:48,719 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:48,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:48,720 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-02-15 10:59:48,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:48,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:48,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:48,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:48,922 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-15 10:59:48,969 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-15 10:59:48,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:48,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:48,970 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:48,970 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-02-15 10:59:48,971 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:48,971 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:48,973 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:48,973 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 10:59:48,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:48,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:48,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:48,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 10:59:48,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:48,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:48,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:48,997 INFO L478 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-15 10:59:49,000 INFO L478 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-15 10:59:49,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,008 INFO L478 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-15 10:59:49,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,014 INFO L478 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-15 10:59:49,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,023 INFO L478 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-15 10:59:49,064 INFO L478 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-15 10:59:49,065 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,138 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,172 INFO L478 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 43 treesize of output 39 [2019-02-15 10:59:49,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,189 INFO L478 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 36 treesize of output 49 [2019-02-15 10:59:49,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 10:59:49,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 10:59:49,265 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,279 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,293 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,308 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,337 INFO L267 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-15 10:59:49,337 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 10:59:49,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,380 INFO L478 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 72 [2019-02-15 10:59:49,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 10:59:49,469 INFO L267 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-15 10:59:49,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-02-15 10:59:49,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,511 INFO L478 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 86 [2019-02-15 10:59:49,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:49,573 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:49,574 INFO L478 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 59 [2019-02-15 10:59:49,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:49,616 INFO L267 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-15 10:59:49,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-02-15 10:59:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:59:49,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:49,723 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-15 10:59:49,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:49,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 10:59:49,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:49,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:59:49,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:59:49,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-15 10:59:49,743 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-02-15 10:59:50,092 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-02-15 10:59:50,310 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-02-15 10:59:51,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:51,119 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-02-15 10:59:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:59:51,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 10:59:51,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:51,123 INFO L225 Difference]: With dead ends: 985 [2019-02-15 10:59:51,123 INFO L226 Difference]: Without dead ends: 984 [2019-02-15 10:59:51,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:59:51,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-02-15 10:59:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-02-15 10:59:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-02-15 10:59:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-02-15 10:59:51,494 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-02-15 10:59:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:51,494 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-02-15 10:59:51,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:59:51,494 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-02-15 10:59:51,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:51,496 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:51,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:51,496 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:51,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:51,496 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-02-15 10:59:51,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:51,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:51,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:51,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:51,601 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-15 10:59:51,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:51,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:51,602 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:51,602 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-02-15 10:59:51,603 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:51,603 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:51,604 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:51,604 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:59:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:51,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:51,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:51,606 INFO 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-15 10:59:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:51,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:51,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:51,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:51,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:51,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,721 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:51,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,776 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:51,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:51,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:51,844 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,870 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:51,980 INFO L478 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-15 10:59:51,983 INFO L478 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-15 10:59:51,986 INFO L478 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-15 10:59:51,989 INFO L478 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-15 10:59:51,992 INFO L478 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-15 10:59:51,995 INFO L478 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-15 10:59:51,996 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,030 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,049 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,064 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,077 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,131 INFO L267 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-15 10:59:52,131 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:52,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,172 INFO L478 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 97 [2019-02-15 10:59:52,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,214 INFO L267 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-15 10:59:52,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,256 INFO L478 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 103 [2019-02-15 10:59:52,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,301 INFO L267 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-15 10:59:52,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:52,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,345 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:52,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,347 INFO L478 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 118 [2019-02-15 10:59:52,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,394 INFO L267 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-15 10:59:52,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 10:59:52,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,434 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:52,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:52,435 INFO L478 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 124 [2019-02-15 10:59:52,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:52,485 INFO L267 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-15 10:59:52,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 10:59:52,510 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-15 10:59:52,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:53,224 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-15 10:59:53,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:53,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:59:53,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:53,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:59:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:59:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:59:53,243 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-02-15 10:59:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:59:57,406 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-02-15 10:59:57,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:59:57,406 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 10:59:57,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:59:57,411 INFO L225 Difference]: With dead ends: 1024 [2019-02-15 10:59:57,411 INFO L226 Difference]: Without dead ends: 1023 [2019-02-15 10:59:57,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-15 10:59:57,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-02-15 10:59:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-02-15 10:59:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-02-15 10:59:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-02-15 10:59:57,806 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-02-15 10:59:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:59:57,806 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-02-15 10:59:57,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:59:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-02-15 10:59:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:59:57,808 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:59:57,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 10:59:57,808 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:59:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-02-15 10:59:57,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:59:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:59:57,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:59:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:57,973 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-15 10:59:57,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:57,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:59:57,974 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:59:57,974 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-02-15 10:59:57,975 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:59:57,975 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:59:57,977 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:59:57,977 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 10:59:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:59:57,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:59:57,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:59:57,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 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-15 10:59:57,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:59:57,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:59:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:59:57,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:59:58,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 10:59:58,020 INFO L478 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-15 10:59:58,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,025 INFO L478 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-15 10:59:58,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,031 INFO L478 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-15 10:59:58,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,040 INFO L478 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-15 10:59:58,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,048 INFO L478 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-15 10:59:58,049 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,087 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 10:59:58,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 10:59:58,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,264 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 10:59:58,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,323 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 10:59:58,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 10:59:58,414 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,439 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,463 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,488 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,513 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,556 INFO L267 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-15 10:59:58,556 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 10:59:58,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,600 INFO L478 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 97 [2019-02-15 10:59:58,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,643 INFO L267 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-15 10:59:58,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 10:59:58,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,685 INFO L478 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 103 [2019-02-15 10:59:58,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,727 INFO L267 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-15 10:59:58,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 10:59:58,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,769 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:58,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,771 INFO L478 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 118 [2019-02-15 10:59:58,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,816 INFO L267 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-15 10:59:58,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 10:59:58,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 10:59:58,858 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 10:59:58,859 INFO L478 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 125 [2019-02-15 10:59:58,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:59:58,906 INFO L267 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-15 10:59:58,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-15 10:59:58,930 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-15 10:59:58,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:59:58,982 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-15 10:59:59,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:59:59,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 10:59:59,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:59:59,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:59:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:59:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-02-15 10:59:59,002 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-02-15 11:00:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:00,241 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-02-15 11:00:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:00:00,242 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:00,246 INFO L225 Difference]: With dead ends: 1059 [2019-02-15 11:00:00,246 INFO L226 Difference]: Without dead ends: 1057 [2019-02-15 11:00:00,247 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-15 11:00:00,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-02-15 11:00:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-02-15 11:00:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-02-15 11:00:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-02-15 11:00:00,653 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-02-15 11:00:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:00,653 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-02-15 11:00:00,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:00:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-02-15 11:00:00,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:00,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:00,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:00,655 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:00,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-02-15 11:00:00,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:00,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:00,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:00,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:00,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:00,734 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-15 11:00:00,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:00,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:00,735 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:00,735 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-02-15 11:00:00,736 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:00,736 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:00,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:00,738 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:00:00,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:00,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:00,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:00,738 INFO 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-15 11:00:00,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:00,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:00,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:00,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:00:00,770 INFO L478 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-15 11:00:00,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,775 INFO L478 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-15 11:00:00,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,782 INFO L478 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-15 11:00:00,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,790 INFO L478 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-15 11:00:00,798 INFO L478 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-15 11:00:00,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,825 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,878 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:00,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:00:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:00:00,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:00,985 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:00:01,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 11:00:01,033 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,048 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,063 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,078 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,109 INFO L267 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-15 11:00:01,109 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-15 11:00:01,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,173 INFO L478 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 72 [2019-02-15 11:00:01,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,201 INFO L267 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-15 11:00:01,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:00:01,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,236 INFO L478 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 78 [2019-02-15 11:00:01,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,264 INFO L267 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-15 11:00:01,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-15 11:00:01,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,300 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:01,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,302 INFO L478 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 97 [2019-02-15 11:00:01,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,335 INFO L267 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-15 11:00:01,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-15 11:00:01,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:01,374 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:01,375 INFO L478 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 100 [2019-02-15 11:00:01,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:01,407 INFO L267 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-15 11:00:01,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 11:00:01,428 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-15 11:00:01,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:01,489 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-15 11:00:01,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:01,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:00:01,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:01,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:01,507 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-02-15 11:00:03,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:03,575 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-02-15 11:00:03,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:00:03,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:03,580 INFO L225 Difference]: With dead ends: 1044 [2019-02-15 11:00:03,580 INFO L226 Difference]: Without dead ends: 1042 [2019-02-15 11:00:03,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:00:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-02-15 11:00:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-02-15 11:00:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-02-15 11:00:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-02-15 11:00:04,017 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-02-15 11:00:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:04,017 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-02-15 11:00:04,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:00:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-02-15 11:00:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:04,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:04,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:04,020 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:04,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-02-15 11:00:04,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:04,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:04,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:04,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:04,151 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-15 11:00:04,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:04,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:04,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:04,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:04,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:04,152 INFO 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-15 11:00:04,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:00:04,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:00:04,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:00:04,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:04,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:04,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:04,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:04,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,270 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:04,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,324 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:04,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:00:04,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,416 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,468 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,529 INFO L478 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-15 11:00:04,531 INFO L478 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-15 11:00:04,534 INFO L478 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-15 11:00:04,536 INFO L478 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-15 11:00:04,538 INFO L478 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-15 11:00:04,540 INFO L478 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-15 11:00:04,541 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,573 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,593 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,620 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,632 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,675 INFO L267 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-15 11:00:04,675 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:00:04,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,717 INFO L478 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 97 [2019-02-15 11:00:04,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,760 INFO L267 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-15 11:00:04,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:04,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,802 INFO L478 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 103 [2019-02-15 11:00:04,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,846 INFO L267 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-15 11:00:04,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:00:04,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,891 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:04,892 INFO L478 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 123 [2019-02-15 11:00:04,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:04,939 INFO L267 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-15 11:00:04,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-15 11:00:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,980 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:04,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:04,982 INFO L478 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 118 [2019-02-15 11:00:04,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:05,029 INFO L267 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-15 11:00:05,030 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-02-15 11:00:05,242 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-15 11:00:05,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:05,303 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-15 11:00:05,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:00:05,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:05,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:05,322 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-02-15 11:00:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:06,585 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-02-15 11:00:06,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:00:06,585 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:06,589 INFO L225 Difference]: With dead ends: 1044 [2019-02-15 11:00:06,589 INFO L226 Difference]: Without dead ends: 1041 [2019-02-15 11:00:06,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:00:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-02-15 11:00:06,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-02-15 11:00:06,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-02-15 11:00:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-02-15 11:00:06,999 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-02-15 11:00:06,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:06,999 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-02-15 11:00:06,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:00:06,999 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-02-15 11:00:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:07,001 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:07,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:07,001 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:07,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:07,001 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-02-15 11:00:07,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:07,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:07,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:07,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:07,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:07,075 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-15 11:00:07,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:07,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:07,076 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:07,076 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-02-15 11:00:07,077 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:07,077 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:07,079 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:07,079 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:00:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:07,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:07,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:07,080 INFO 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-15 11:00:07,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:07,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:07,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:07,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:00:07,120 INFO L478 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-15 11:00:07,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,124 INFO L478 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-15 11:00:07,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,131 INFO L478 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-15 11:00:07,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,139 INFO L478 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-15 11:00:07,147 INFO L478 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-15 11:00:07,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,212 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:00:07,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:00:07,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,336 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:00:07,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 11:00:07,384 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,417 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,432 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:07,478 INFO L267 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-15 11:00:07,478 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:00:07,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,583 INFO L478 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 81 [2019-02-15 11:00:07,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:07,685 INFO L267 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-15 11:00:07,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-02-15 11:00:07,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,812 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:07,821 INFO L478 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 93 [2019-02-15 11:00:07,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:07,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:07,966 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:07,967 INFO L478 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 80 [2019-02-15 11:00:07,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:08,049 INFO L267 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-15 11:00:08,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-02-15 11:00:08,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,187 INFO L478 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 95 [2019-02-15 11:00:08,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:08,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,357 INFO L478 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 93 [2019-02-15 11:00:08,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:08,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,476 INFO L478 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 86 [2019-02-15 11:00:08,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:08,569 INFO L267 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-15 11:00:08,569 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-02-15 11:00:08,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,713 INFO L478 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 102 [2019-02-15 11:00:08,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:08,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,846 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:08,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:08,862 INFO L478 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 118 [2019-02-15 11:00:08,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-02-15 11:00:09,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,132 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:09,132 INFO L478 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 92 [2019-02-15 11:00:09,133 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:09,314 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:09,315 INFO L478 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 98 [2019-02-15 11:00:09,315 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:09,446 INFO L267 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-15 11:00:09,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-02-15 11:00:09,666 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-02-15 11:00:09,668 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-15 11:00:09,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:09,760 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-15 11:00:09,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:09,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:00:09,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:09,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:09,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:09,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:09,778 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-02-15 11:00:09,962 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-02-15 11:00:10,217 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-02-15 11:00:10,612 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-02-15 11:00:11,047 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-02-15 11:00:11,526 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-02-15 11:00:12,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:12,378 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-02-15 11:00:12,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:00:12,379 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:12,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:12,383 INFO L225 Difference]: With dead ends: 1104 [2019-02-15 11:00:12,383 INFO L226 Difference]: Without dead ends: 1102 [2019-02-15 11:00:12,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-15 11:00:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-02-15 11:00:12,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-02-15 11:00:12,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-02-15 11:00:12,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-02-15 11:00:12,817 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-02-15 11:00:12,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:12,817 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-02-15 11:00:12,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:00:12,817 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-02-15 11:00:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:12,819 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:12,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:12,819 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:12,819 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-02-15 11:00:12,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:12,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:12,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:12,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:12,918 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-15 11:00:12,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:12,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:12,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:12,918 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-02-15 11:00:12,919 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:12,919 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:12,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:12,921 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:00:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:12,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:12,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:12,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:00:12,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:12,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:12,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:13,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:00:13,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:00:13,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,082 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:00:13,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 11:00:13,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,227 INFO L478 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-15 11:00:13,229 INFO L478 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-15 11:00:13,232 INFO L478 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-15 11:00:13,242 INFO L478 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-15 11:00:13,244 INFO L478 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-15 11:00:13,249 INFO L478 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-15 11:00:13,250 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,274 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,293 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,308 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,321 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,332 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,363 INFO L267 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-15 11:00:13,363 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:00:13,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,418 INFO L478 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 72 [2019-02-15 11:00:13,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,446 INFO L267 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-15 11:00:13,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:00:13,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,477 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:13,478 INFO L478 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 80 [2019-02-15 11:00:13,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,506 INFO L267 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-15 11:00:13,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-02-15 11:00:13,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,537 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,538 INFO L478 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 78 [2019-02-15 11:00:13,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,567 INFO L267 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-15 11:00:13,567 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-15 11:00:13,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,599 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:13,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:13,601 INFO L478 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 93 [2019-02-15 11:00:13,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:13,634 INFO L267 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-15 11:00:13,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-02-15 11:00:13,654 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-15 11:00:13,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:13,698 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-15 11:00:13,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:13,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:00:13,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:13,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:13,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:13,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:13,716 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-02-15 11:00:16,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:16,111 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-02-15 11:00:16,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:00:16,111 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:16,117 INFO L225 Difference]: With dead ends: 1313 [2019-02-15 11:00:16,117 INFO L226 Difference]: Without dead ends: 1312 [2019-02-15 11:00:16,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:00:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-02-15 11:00:16,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-02-15 11:00:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-02-15 11:00:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-02-15 11:00:16,560 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-02-15 11:00:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:16,560 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-02-15 11:00:16,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:00:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-02-15 11:00:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:16,562 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:16,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:16,562 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-02-15 11:00:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:16,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:16,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:16,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:00:16,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:16,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:16,612 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:16,613 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-02-15 11:00:16,613 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:16,614 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:16,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:16,615 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:16,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:16,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:16,616 INFO 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-15 11:00:16,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:16,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:16,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:16,666 INFO L478 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-15 11:00:16,709 INFO L478 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-15 11:00:16,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,790 INFO L478 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-15 11:00:16,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,854 INFO L478 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-15 11:00:16,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,861 INFO L478 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-15 11:00:16,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:16,872 INFO L478 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-15 11:00:16,873 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,348 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,623 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:17,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,421 INFO L478 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 63 treesize of output 56 [2019-02-15 11:00:18,576 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-02-15 11:00:18,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,615 INFO L478 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 53 treesize of output 63 [2019-02-15 11:00:18,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:00:18,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,708 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:00:18,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:00:18,772 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,795 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,818 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,841 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,866 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,907 INFO L267 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-15 11:00:18,907 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:00:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:18,941 INFO L478 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 93 [2019-02-15 11:00:18,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:18,980 INFO L267 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-15 11:00:18,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:00:19,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,018 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,018 INFO L478 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 107 [2019-02-15 11:00:19,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:19,062 INFO L267 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-15 11:00:19,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-15 11:00:19,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:19,157 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:19,158 INFO L478 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 119 [2019-02-15 11:00:19,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:19,203 INFO L267 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-15 11:00:19,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-02-15 11:00:19,225 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-15 11:00:19,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:19,284 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-15 11:00:19,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:19,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:19,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:19,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:19,302 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-02-15 11:00:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:20,206 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-02-15 11:00:20,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:00:20,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:00:20,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:20,210 INFO L225 Difference]: With dead ends: 881 [2019-02-15 11:00:20,210 INFO L226 Difference]: Without dead ends: 880 [2019-02-15 11:00:20,210 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-15 11:00:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-02-15 11:00:20,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-02-15 11:00:20,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-02-15 11:00:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-02-15 11:00:20,644 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-02-15 11:00:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:20,644 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-02-15 11:00:20,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:20,645 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-02-15 11:00:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:20,646 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:20,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:20,646 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-02-15 11:00:20,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:20,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:20,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:20,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:21,018 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-02-15 11:00:21,112 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-15 11:00:21,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:21,112 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:21,112 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:21,112 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-02-15 11:00:21,113 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:21,113 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:21,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:21,115 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:21,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:21,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:21,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:21,116 INFO 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-15 11:00:21,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:21,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:21,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:21,139 INFO L478 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-15 11:00:21,142 INFO L478 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-15 11:00:21,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,147 INFO L478 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-15 11:00:21,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,153 INFO L478 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-15 11:00:21,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,160 INFO L478 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-15 11:00:21,168 INFO L478 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-15 11:00:21,169 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,194 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,241 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,275 INFO L478 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 43 treesize of output 39 [2019-02-15 11:00:21,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,291 INFO L478 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 36 treesize of output 49 [2019-02-15 11:00:21,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:00:21,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:00:21,382 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,396 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,410 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,425 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,453 INFO L267 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-15 11:00:21,454 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:00:21,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,492 INFO L478 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 68 [2019-02-15 11:00:21,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,517 INFO L267 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-15 11:00:21,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-15 11:00:21,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,554 INFO L478 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 86 [2019-02-15 11:00:21,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:21,647 INFO L267 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-15 11:00:21,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-15 11:00:21,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:21,690 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:21,691 INFO L478 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 77 [2019-02-15 11:00:21,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:21,794 INFO L267 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-15 11:00:21,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-15 11:00:21,811 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-15 11:00:21,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:21,836 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-15 11:00:21,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:21,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:00:21,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:21,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:21,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:21,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:21,856 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-02-15 11:00:23,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:23,040 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-02-15 11:00:23,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:00:23,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:00:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:23,045 INFO L225 Difference]: With dead ends: 1415 [2019-02-15 11:00:23,045 INFO L226 Difference]: Without dead ends: 1413 [2019-02-15 11:00:23,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-02-15 11:00:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-02-15 11:00:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-02-15 11:00:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-02-15 11:00:23,734 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-02-15 11:00:23,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:23,735 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-02-15 11:00:23,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-02-15 11:00:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:23,737 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:23,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:23,738 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:23,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:23,738 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-02-15 11:00:23,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:23,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:23,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:23,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:23,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:23,801 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-15 11:00:23,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:23,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:23,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:23,801 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-02-15 11:00:23,802 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:23,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:23,803 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:23,804 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:00:23,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:23,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:23,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:23,804 INFO 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-15 11:00:23,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:23,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:23,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:23,824 INFO L478 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 43 treesize of output 39 [2019-02-15 11:00:23,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,839 INFO L478 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 36 treesize of output 49 [2019-02-15 11:00:23,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:00:23,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,919 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,921 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:23,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:00:23,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:23,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:23,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:23,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:23,989 INFO L478 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-15 11:00:23,993 INFO L478 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-15 11:00:23,998 INFO L478 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-15 11:00:24,001 INFO L478 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-15 11:00:24,005 INFO L478 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-15 11:00:24,014 INFO L478 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-15 11:00:24,014 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,038 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,069 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,080 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,091 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:24,120 INFO L267 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-15 11:00:24,120 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:00:24,301 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-02-15 11:00:24,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,354 INFO L478 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-15 11:00:24,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-02-15 11:00:24,720 INFO L267 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-15 11:00:24,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:349 [2019-02-15 11:00:24,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:24,831 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:24,839 INFO L478 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 99 [2019-02-15 11:00:24,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:25,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,010 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:25,018 INFO L478 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 93 [2019-02-15 11:00:25,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:25,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,191 INFO L478 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 61 [2019-02-15 11:00:25,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,294 INFO L267 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-15 11:00:25,294 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:162, output treesize:180 [2019-02-15 11:00:25,475 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 60 [2019-02-15 11:00:25,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,484 INFO L478 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 75 [2019-02-15 11:00:25,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,554 INFO L478 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 61 [2019-02-15 11:00:25,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:25,610 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:25,611 INFO L478 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 61 [2019-02-15 11:00:25,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:25,657 INFO L267 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-15 11:00:25,657 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-02-15 11:00:25,711 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-15 11:00:25,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:25,757 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-15 11:00:25,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:25,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:00:25,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:25,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:25,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:25,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:00:25,776 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-02-15 11:00:26,167 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-02-15 11:00:26,757 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-02-15 11:00:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:35,593 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-02-15 11:00:35,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:00:35,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:00:35,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:35,598 INFO L225 Difference]: With dead ends: 1381 [2019-02-15 11:00:35,598 INFO L226 Difference]: Without dead ends: 1379 [2019-02-15 11:00:35,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:00:35,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-02-15 11:00:36,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-02-15 11:00:36,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-15 11:00:36,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-15 11:00:36,317 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-15 11:00:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:36,317 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-15 11:00:36,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-15 11:00:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:36,319 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:36,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:36,319 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:36,320 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-02-15 11:00:36,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:36,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:36,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:36,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:36,371 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-15 11:00:36,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:36,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:36,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:36,371 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-02-15 11:00:36,372 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:36,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:36,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:36,374 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:36,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:36,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:36,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:36,375 INFO 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-15 11:00:36,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:36,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:36,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:36,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:36,398 INFO L478 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 63 treesize of output 56 [2019-02-15 11:00:36,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,417 INFO L478 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 53 treesize of output 63 [2019-02-15 11:00:36,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:00:36,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,529 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:00:36,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:00:36,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,736 INFO L478 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-15 11:00:36,760 INFO L478 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-15 11:00:36,764 INFO L478 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-15 11:00:36,768 INFO L478 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-15 11:00:36,771 INFO L478 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-15 11:00:36,775 INFO L478 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-15 11:00:36,775 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,807 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,825 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,839 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,850 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,862 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,902 INFO L267 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-15 11:00:36,903 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:00:36,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,926 INFO L478 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 93 [2019-02-15 11:00:36,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:36,966 INFO L267 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-15 11:00:36,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:00:36,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,990 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:36,997 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:37,005 INFO L478 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 112 [2019-02-15 11:00:37,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:00:37,144 INFO L267 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-15 11:00:37,144 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-02-15 11:00:37,208 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-15 11:00:37,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:37,228 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-15 11:00:37,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:37,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:00:37,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:37,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:37,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:37,247 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-02-15 11:00:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:38,323 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-02-15 11:00:38,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:00:38,324 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:00:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:38,328 INFO L225 Difference]: With dead ends: 1306 [2019-02-15 11:00:38,328 INFO L226 Difference]: Without dead ends: 1305 [2019-02-15 11:00:38,328 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-15 11:00:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-02-15 11:00:39,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-02-15 11:00:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-02-15 11:00:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-02-15 11:00:39,013 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-02-15 11:00:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:39,013 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-02-15 11:00:39,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-02-15 11:00:39,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:39,015 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:39,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:39,015 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:39,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:39,016 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-02-15 11:00:39,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:39,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:39,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:39,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:39,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:39,210 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-02-15 11:00:39,262 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-15 11:00:39,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:39,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:39,263 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:39,263 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-02-15 11:00:39,265 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:39,266 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:39,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:39,267 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:00:39,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:39,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:39,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:39,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:00:39,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:39,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:39,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:39,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:39,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:39,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,388 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:39,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,444 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:39,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:00:39,511 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,537 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,588 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,646 INFO L478 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-15 11:00:39,649 INFO L478 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-15 11:00:39,667 INFO L478 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-15 11:00:39,673 INFO L478 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-15 11:00:39,676 INFO L478 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-15 11:00:39,678 INFO L478 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-15 11:00:39,678 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,712 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,732 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,747 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,759 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,771 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,814 INFO L267 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-15 11:00:39,814 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:00:39,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,855 INFO L478 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 97 [2019-02-15 11:00:39,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,903 INFO L267 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-15 11:00:39,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:39,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:39,945 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:39,946 INFO L478 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 112 [2019-02-15 11:00:39,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:39,992 INFO L267 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-15 11:00:39,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-02-15 11:00:40,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,035 INFO L478 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 115 [2019-02-15 11:00:40,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,078 INFO L267 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-15 11:00:40,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-02-15 11:00:40,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:40,117 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:40,118 INFO L478 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 120 [2019-02-15 11:00:40,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:40,164 INFO L267 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-15 11:00:40,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-02-15 11:00:40,193 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-15 11:00:40,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:40,252 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-15 11:00:40,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:40,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:00:40,271 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:40,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:40,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:00:40,271 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-02-15 11:00:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:41,786 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-02-15 11:00:41,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:00:41,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:41,792 INFO L225 Difference]: With dead ends: 1360 [2019-02-15 11:00:41,792 INFO L226 Difference]: Without dead ends: 1358 [2019-02-15 11:00:41,792 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-15 11:00:41,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-02-15 11:00:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-02-15 11:00:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-02-15 11:00:42,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-02-15 11:00:42,472 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-02-15 11:00:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:42,472 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-02-15 11:00:42,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:00:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-02-15 11:00:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:42,475 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:42,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:42,475 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-02-15 11:00:42,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:42,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:42,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:42,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:42,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:42,558 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-15 11:00:42,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:42,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:42,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:00:42,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:00:42,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:42,559 INFO 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-15 11:00:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:00:42,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:00:42,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:00:42,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:00:42,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:42,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:42,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:42,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,683 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:42,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,739 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:42,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:42,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:00:42,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:42,834 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,186 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,350 INFO L478 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-15 11:00:43,353 INFO L478 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-15 11:00:43,356 INFO L478 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-15 11:00:43,358 INFO L478 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-15 11:00:43,362 INFO L478 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-15 11:00:43,365 INFO L478 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-15 11:00:43,365 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,400 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,419 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,447 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,458 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,503 INFO L267 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-15 11:00:43,504 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-02-15 11:00:43,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,530 INFO L478 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 97 [2019-02-15 11:00:43,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,574 INFO L267 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-15 11:00:43,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:43,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,605 INFO L478 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 113 [2019-02-15 11:00:43,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,680 INFO L267 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-15 11:00:43,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-02-15 11:00:43,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:43,715 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:43,716 INFO L478 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 123 [2019-02-15 11:00:43,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:43,762 INFO L267 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-15 11:00:43,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-02-15 11:00:43,783 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-15 11:00:43,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:43,814 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-15 11:00:43,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:43,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:00:43,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:43,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:00:43,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:00:43,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:00:43,833 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-02-15 11:00:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:45,506 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-02-15 11:00:45,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:00:45,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:00:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:45,511 INFO L225 Difference]: With dead ends: 1898 [2019-02-15 11:00:45,512 INFO L226 Difference]: Without dead ends: 1896 [2019-02-15 11:00:45,512 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-15 11:00:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-15 11:00:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-02-15 11:00:46,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-02-15 11:00:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-02-15 11:00:46,533 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-02-15 11:00:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:46,534 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-02-15 11:00:46,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:00:46,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-02-15 11:00:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:46,538 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:46,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:46,538 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:46,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-02-15 11:00:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:46,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:00:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:46,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:46,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:46,718 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-02-15 11:00:46,739 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-15 11:00:46,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 11:00:46,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-15 11:00:46,740 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:00:46,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-15 11:00:46,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-15 11:00:46,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-15 11:00:46,741 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-02-15 11:00:47,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:47,816 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-02-15 11:00:47,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:00:47,817 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-15 11:00:47,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:47,821 INFO L225 Difference]: With dead ends: 1693 [2019-02-15 11:00:47,821 INFO L226 Difference]: Without dead ends: 1692 [2019-02-15 11:00:47,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:00:47,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-02-15 11:00:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-02-15 11:00:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-02-15 11:00:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-02-15 11:00:48,851 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-02-15 11:00:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:48,851 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-02-15 11:00:48,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-15 11:00:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-02-15 11:00:48,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:48,854 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:48,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:48,854 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:48,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:48,854 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-02-15 11:00:48,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:48,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:48,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:48,898 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-15 11:00:48,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:48,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:48,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:48,899 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-02-15 11:00:48,900 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:48,900 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:48,901 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:48,901 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:00:48,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:48,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:48,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:48,902 INFO 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-15 11:00:48,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:48,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:48,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:48,919 INFO L478 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-15 11:00:48,922 INFO L478 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-15 11:00:48,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,929 INFO L478 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-15 11:00:48,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,935 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,935 INFO L478 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-15 11:00:48,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,945 INFO L478 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-15 11:00:48,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:48,955 INFO L478 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-15 11:00:48,955 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:48,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,083 INFO L478 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 63 treesize of output 56 [2019-02-15 11:00:49,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,102 INFO L478 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 53 treesize of output 63 [2019-02-15 11:00:49,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:00:49,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,196 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:00:49,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:00:49,260 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,283 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,306 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,329 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,354 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,396 INFO L267 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-15 11:00:49,396 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-02-15 11:00:49,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,417 INFO L478 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 93 [2019-02-15 11:00:49,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,497 INFO L267 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-15 11:00:49,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:00:49,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:49,527 INFO L478 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 99 [2019-02-15 11:00:49,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:49,570 INFO L267 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-15 11:00:49,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-02-15 11:00:49,588 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-15 11:00:49,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:49,599 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-15 11:00:49,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:49,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:00:49,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:49,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:00:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:00:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:00:49,618 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-02-15 11:00:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:51,661 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-02-15 11:00:51,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:00:51,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-15 11:00:51,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:51,669 INFO L225 Difference]: With dead ends: 2759 [2019-02-15 11:00:51,669 INFO L226 Difference]: Without dead ends: 2757 [2019-02-15 11:00:51,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:00:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-02-15 11:00:53,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-02-15 11:00:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-02-15 11:00:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-02-15 11:00:53,376 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-02-15 11:00:53,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:00:53,376 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-02-15 11:00:53,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:00:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-02-15 11:00:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:00:53,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:00:53,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:00:53,380 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:00:53,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:53,380 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-02-15 11:00:53,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:00:53,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:53,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:53,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:00:53,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:00:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:53,492 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-15 11:00:53,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:53,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:00:53,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 11:00:53,492 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-02-15 11:00:53,493 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:00:53,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:00:53,495 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:00:53,495 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:00:53,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:00:53,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:00:53,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:00:53,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:00:53,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:00:53,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:00:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:00:53,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:00:53,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:00:53,548 INFO L478 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-15 11:00:53,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,553 INFO L478 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-15 11:00:53,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,559 INFO L478 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-15 11:00:53,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,567 INFO L478 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-15 11:00:53,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,576 INFO L478 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-15 11:00:53,577 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,614 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,636 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:00:53,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:00:53,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,795 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:00:53,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,847 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:00:53,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:53,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:00:53,916 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,941 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,965 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:53,993 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,018 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,062 INFO L267 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-15 11:00:54,062 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:00:54,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,096 INFO L478 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 97 [2019-02-15 11:00:54,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,139 INFO L267 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-15 11:00:54,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:00:54,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,175 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:54,176 INFO L478 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 105 [2019-02-15 11:00:54,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,218 INFO L267 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-15 11:00:54,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-15 11:00:54,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,254 INFO L478 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 103 [2019-02-15 11:00:54,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,294 INFO L267 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-15 11:00:54,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-15 11:00:54,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,324 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,335 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:00:54,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:00:54,337 INFO L478 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 122 [2019-02-15 11:00:54,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:00:54,384 INFO L267 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-15 11:00:54,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-02-15 11:00:54,407 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-15 11:00:54,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:00:54,453 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-15 11:00:54,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:00:54,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:00:54,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:00:54,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:00:54,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:00:54,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:00:54,472 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-02-15 11:00:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:00:57,906 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-02-15 11:00:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:00:57,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-02-15 11:00:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:00:57,917 INFO L225 Difference]: With dead ends: 3636 [2019-02-15 11:00:57,918 INFO L226 Difference]: Without dead ends: 3626 [2019-02-15 11:00:57,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:00:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-02-15 11:01:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-02-15 11:01:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-02-15 11:01:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-02-15 11:01:00,527 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-02-15 11:01:00,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:00,527 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-02-15 11:01:00,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:01:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-02-15 11:01:00,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 11:01:00,531 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:00,531 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-15 11:01:00,531 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:00,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:00,531 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-02-15 11:01:00,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:00,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:00,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:00,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:00,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:00,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:01:00,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:01:00,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:00,591 INFO 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-15 11:01:00,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:01:00,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:01:00,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:01:00,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:01:00,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:00,610 INFO L478 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-15 11:01:00,613 INFO L478 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-15 11:01:00,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,618 INFO L478 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-15 11:01:00,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,627 INFO L478 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-15 11:01:00,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,635 INFO L478 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-15 11:01:00,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,645 INFO L478 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-15 11:01:00,645 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,684 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,733 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,745 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,772 INFO L478 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 63 treesize of output 56 [2019-02-15 11:01:00,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,792 INFO L478 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 53 treesize of output 63 [2019-02-15 11:01:00,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:01:00,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,882 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:01:00,937 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:00,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:01:00,947 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,969 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:00,992 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:01,015 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:01,040 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:01,082 INFO L267 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-15 11:01:01,082 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:01:01,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,110 INFO L478 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 93 [2019-02-15 11:01:01,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:01,151 INFO L267 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-15 11:01:01,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:01:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,176 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,191 INFO L478 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 111 [2019-02-15 11:01:01,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:01:01,332 INFO L267 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-15 11:01:01,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-02-15 11:01:01,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:01,412 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:01,413 INFO L478 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 88 [2019-02-15 11:01:01,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:01,449 INFO L267 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-15 11:01:01,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-02-15 11:01:01,466 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-15 11:01:01,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:01,502 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-15 11:01:01,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:01,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:01:01,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:01,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:01:01,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:01:01,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:01:01,520 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-02-15 11:01:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:05,474 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-02-15 11:01:05,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:01:05,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-15 11:01:05,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:05,487 INFO L225 Difference]: With dead ends: 4300 [2019-02-15 11:01:05,487 INFO L226 Difference]: Without dead ends: 4298 [2019-02-15 11:01:05,489 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-15 11:01:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-02-15 11:01:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-02-15 11:01:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-02-15 11:01:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-02-15 11:01:09,222 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-02-15 11:01:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:09,222 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-02-15 11:01:09,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:01:09,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-02-15 11:01:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:01:09,228 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:09,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:09,228 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:09,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-02-15 11:01:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:09,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:01:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:09,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:09,294 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-15 11:01:09,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:09,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:09,295 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:01:09,295 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-02-15 11:01:09,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:09,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:09,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:09,297 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:01:09,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:09,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:09,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:09,298 INFO 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-15 11:01:09,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:09,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:09,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:09,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:01:09,340 INFO L478 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-15 11:01:09,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,346 INFO L478 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-15 11:01:09,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,353 INFO L478 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-15 11:01:09,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,360 INFO L478 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-15 11:01:09,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,369 INFO L478 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-15 11:01:09,369 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,407 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:09,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:09,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,588 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:09,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,643 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:09,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:01:09,712 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,749 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,771 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,796 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,821 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,864 INFO L267 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-15 11:01:09,864 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:01:09,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,905 INFO L478 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-15 11:01:09,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:09,943 INFO L267 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-15 11:01:09,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:01:09,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:09,986 INFO L478 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 113 [2019-02-15 11:01:09,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,034 INFO L267 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-15 11:01:10,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:01:10,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,080 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:10,081 INFO L478 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 119 [2019-02-15 11:01:10,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,128 INFO L267 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-15 11:01:10,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-15 11:01:10,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,173 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:10,175 INFO L478 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 118 [2019-02-15 11:01:10,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:10,222 INFO L267 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-15 11:01:10,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-02-15 11:01:10,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:10,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:10,305 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-15 11:01:10,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:10,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-15 11:01:10,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:10,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:01:10,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:01:10,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:01:10,324 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-02-15 11:01:14,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:14,622 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-02-15 11:01:14,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:01:14,623 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:01:14,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:14,635 INFO L225 Difference]: With dead ends: 4236 [2019-02-15 11:01:14,635 INFO L226 Difference]: Without dead ends: 4233 [2019-02-15 11:01:14,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:01:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-02-15 11:01:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-02-15 11:01:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-02-15 11:01:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-02-15 11:01:18,394 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-02-15 11:01:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:18,394 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-02-15 11:01:18,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:01:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-02-15 11:01:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:01:18,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:18,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:18,400 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-02-15 11:01:18,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:18,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:18,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:18,401 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:18,523 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-15 11:01:18,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:18,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:18,524 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:01:18,524 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-02-15 11:01:18,525 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:18,525 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:18,526 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:18,526 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:01:18,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:18,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:18,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:18,527 INFO 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-15 11:01:18,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:18,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:18,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:18,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:01:18,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:01:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,634 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:01:18,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 11:01:18,689 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,760 INFO L478 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-15 11:01:18,763 INFO L478 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-15 11:01:18,766 INFO L478 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-15 11:01:18,769 INFO L478 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-15 11:01:18,772 INFO L478 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-15 11:01:18,779 INFO L478 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-15 11:01:18,780 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,804 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,823 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,838 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,851 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,862 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,892 INFO L267 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-15 11:01:18,893 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-02-15 11:01:18,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:18,968 INFO L478 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-15 11:01:18,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:18,996 INFO L267 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-15 11:01:18,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:01:19,153 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-02-15 11:01:19,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,163 INFO L478 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 88 [2019-02-15 11:01:19,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:19,196 INFO L267 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-15 11:01:19,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:01:19,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,235 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:19,236 INFO L478 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 94 [2019-02-15 11:01:19,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:19,270 INFO L267 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-15 11:01:19,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-15 11:01:19,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:19,306 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:19,306 INFO L478 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 98 [2019-02-15 11:01:19,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:19,338 INFO L267 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-15 11:01:19,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 11:01:19,372 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-15 11:01:19,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:19,434 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-15 11:01:19,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:19,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:01:19,453 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:19,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:01:19,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:01:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:19,453 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-02-15 11:01:23,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:23,607 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-02-15 11:01:23,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:01:23,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:01:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:23,621 INFO L225 Difference]: With dead ends: 4232 [2019-02-15 11:01:23,621 INFO L226 Difference]: Without dead ends: 4231 [2019-02-15 11:01:23,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:01:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-02-15 11:01:27,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-02-15 11:01:27,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-02-15 11:01:27,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-02-15 11:01:27,386 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-02-15 11:01:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:27,386 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-02-15 11:01:27,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:01:27,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-02-15 11:01:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:01:27,392 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:27,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:27,392 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:27,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-02-15 11:01:27,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:27,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:27,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:27,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:27,457 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-15 11:01:27,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:27,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:27,458 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:01:27,458 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-02-15 11:01:27,459 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:27,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:27,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:27,461 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:01:27,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:27,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:27,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:27,461 INFO 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-15 11:01:27,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:27,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:27,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:27,481 INFO L478 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 63 treesize of output 56 [2019-02-15 11:01:27,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,501 INFO L478 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 53 treesize of output 63 [2019-02-15 11:01:27,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:01:27,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,600 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:01:27,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:27,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:01:27,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,824 INFO L478 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-15 11:01:27,828 INFO L478 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-15 11:01:27,831 INFO L478 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-15 11:01:27,835 INFO L478 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-15 11:01:27,879 INFO L478 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-15 11:01:27,900 INFO L478 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-15 11:01:27,901 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,931 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,949 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,963 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,975 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:27,986 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:28,027 INFO L267 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-15 11:01:28,027 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:01:28,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,062 INFO L478 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-15 11:01:28,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:28,101 INFO L267 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-15 11:01:28,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:01:28,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,143 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,152 INFO L478 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 113 [2019-02-15 11:01:28,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:01:28,291 INFO L267 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-15 11:01:28,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-02-15 11:01:28,428 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2019-02-15 11:01:28,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,440 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:28,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:28,442 INFO L478 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 97 [2019-02-15 11:01:28,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:28,476 INFO L267 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-15 11:01:28,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-15 11:01:28,498 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-15 11:01:28,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:28,529 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-15 11:01:28,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:28,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:01:28,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:28,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:01:28,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:01:28,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:01:28,547 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-02-15 11:01:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:32,668 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-02-15 11:01:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:01:32,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:01:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:32,682 INFO L225 Difference]: With dead ends: 4570 [2019-02-15 11:01:32,682 INFO L226 Difference]: Without dead ends: 4569 [2019-02-15 11:01:32,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:01:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-02-15 11:01:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-02-15 11:01:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-02-15 11:01:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-02-15 11:01:36,569 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-02-15 11:01:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:36,569 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-02-15 11:01:36,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:01:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-02-15 11:01:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:01:36,576 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:36,576 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:36,576 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:36,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-02-15 11:01:36,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:36,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:36,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:36,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:36,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:36,849 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 19 [2019-02-15 11:01:36,962 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-15 11:01:36,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:36,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:36,963 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:01:36,963 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-02-15 11:01:36,964 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:36,964 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:36,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:36,965 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:01:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:36,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:36,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:36,966 INFO 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-15 11:01:36,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:36,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:36,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:37,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:01:37,005 INFO L478 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-15 11:01:37,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,009 INFO L478 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-15 11:01:37,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,016 INFO L478 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-15 11:01:37,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,024 INFO L478 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-15 11:01:37,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,033 INFO L478 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-15 11:01:37,033 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,073 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,112 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,126 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:01:37,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:01:37,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,251 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:01:37,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,306 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:01:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:01:37,376 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,401 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,425 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,450 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,475 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,517 INFO L267 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-15 11:01:37,517 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:01:37,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,559 INFO L478 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-15 11:01:37,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,597 INFO L267 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-15 11:01:37,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:01:37,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,641 INFO L478 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 113 [2019-02-15 11:01:37,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:37,686 INFO L267 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-15 11:01:37,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:01:37,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,728 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:37,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:37,730 INFO L478 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 122 [2019-02-15 11:01:37,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:38,003 INFO L267 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-15 11:01:38,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-02-15 11:01:38,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:38,051 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:38,052 INFO L478 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 131 [2019-02-15 11:01:38,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:38,102 INFO L267 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-15 11:01:38,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-02-15 11:01:38,132 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-15 11:01:38,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:38,218 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-15 11:01:38,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:38,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-15 11:01:38,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:38,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:01:38,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:01:38,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:01:38,238 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-02-15 11:01:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:44,246 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-02-15 11:01:44,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:01:44,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:01:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:44,266 INFO L225 Difference]: With dead ends: 5928 [2019-02-15 11:01:44,266 INFO L226 Difference]: Without dead ends: 5927 [2019-02-15 11:01:44,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-02-15 11:01:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-02-15 11:01:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-02-15 11:01:49,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-02-15 11:01:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-02-15 11:01:49,501 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-02-15 11:01:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:01:49,501 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-02-15 11:01:49,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:01:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-02-15 11:01:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:01:49,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:01:49,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:01:49,508 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:01:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-02-15 11:01:49,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:01:49,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:49,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:49,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:01:49,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:01:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:49,621 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-15 11:01:49,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:49,621 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:01:49,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:01:49,621 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-02-15 11:01:49,622 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:01:49,622 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:01:49,624 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:01:49,624 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:01:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:01:49,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:01:49,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:01:49,624 INFO 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-15 11:01:49,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:01:49,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:01:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:01:49,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:01:49,640 INFO L478 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-15 11:01:49,644 INFO L478 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-15 11:01:49,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,652 INFO L478 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-15 11:01:49,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,659 INFO L478 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-15 11:01:49,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,668 INFO L478 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-15 11:01:49,678 INFO L478 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-15 11:01:49,678 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,704 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,724 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,786 INFO L478 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 43 treesize of output 39 [2019-02-15 11:01:49,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,802 INFO L478 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 36 treesize of output 49 [2019-02-15 11:01:49,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:01:49,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:49,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:01:49,880 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,894 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,908 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,923 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:01:49,952 INFO L267 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-15 11:01:49,952 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-15 11:01:50,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,000 INFO L478 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-15 11:01:50,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:50,025 INFO L267 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-15 11:01:50,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-15 11:01:50,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,069 INFO L478 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 88 [2019-02-15 11:01:50,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:01:50,162 INFO L267 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-15 11:01:50,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-15 11:01:50,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,213 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:50,213 INFO L478 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 101 [2019-02-15 11:01:50,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:50,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:01:50,276 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:01:50,277 INFO L478 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 73 [2019-02-15 11:01:50,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:01:50,318 INFO L267 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-15 11:01:50,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-15 11:01:50,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:01:50,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:01:50,414 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-15 11:01:50,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:01:50,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-15 11:01:50,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:01:50,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:01:50,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:01:50,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:01:50,434 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-02-15 11:01:52,638 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-02-15 11:01:59,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:01:59,284 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-02-15 11:01:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:01:59,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:01:59,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:01:59,304 INFO L225 Difference]: With dead ends: 6511 [2019-02-15 11:01:59,304 INFO L226 Difference]: Without dead ends: 6510 [2019-02-15 11:01:59,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:01:59,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-02-15 11:02:06,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-02-15 11:02:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-02-15 11:02:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-02-15 11:02:06,045 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-02-15 11:02:06,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:06,045 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-02-15 11:02:06,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:02:06,046 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-02-15 11:02:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:02:06,053 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:06,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:06,053 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:06,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-02-15 11:02:06,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:06,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:06,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:06,219 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-02-15 11:02:06,401 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-15 11:02:06,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:06,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:06,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:02:06,402 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-02-15 11:02:06,402 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:06,402 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:06,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:06,404 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:02:06,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:06,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:06,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:06,405 INFO 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-15 11:02:06,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:06,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:06,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:06,422 INFO L478 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 63 treesize of output 56 [2019-02-15 11:02:06,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,438 INFO L478 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 53 treesize of output 63 [2019-02-15 11:02:06,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:02:06,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,522 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,528 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:02:06,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:02:06,596 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,620 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,667 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,725 INFO L478 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-15 11:02:06,729 INFO L478 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-15 11:02:06,733 INFO L478 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-15 11:02:06,737 INFO L478 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-15 11:02:06,741 INFO L478 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-15 11:02:06,743 INFO L478 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-15 11:02:06,744 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,776 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,792 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,806 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,818 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,829 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,869 INFO L267 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-15 11:02:06,870 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-02-15 11:02:06,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:06,941 INFO L478 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-15 11:02:06,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:06,968 INFO L267 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-15 11:02:06,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-15 11:02:07,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,009 INFO L478 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 80 [2019-02-15 11:02:07,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,037 INFO L267 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-15 11:02:07,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-15 11:02:07,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,081 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:07,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,083 INFO L478 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 93 [2019-02-15 11:02:07,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,116 INFO L267 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-15 11:02:07,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-15 11:02:07,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:07,157 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:07,157 INFO L478 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 100 [2019-02-15 11:02:07,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:07,192 INFO L267 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-15 11:02:07,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-15 11:02:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:02:07,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:07,293 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-15 11:02:07,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:07,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:02:07,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:07,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:02:07,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:02:07,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:02:07,312 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-02-15 11:02:15,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:15,962 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-02-15 11:02:15,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 11:02:15,962 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:02:15,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:15,985 INFO L225 Difference]: With dead ends: 7179 [2019-02-15 11:02:15,985 INFO L226 Difference]: Without dead ends: 7170 [2019-02-15 11:02:15,987 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-15 11:02:15,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-02-15 11:02:22,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-02-15 11:02:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-02-15 11:02:22,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-02-15 11:02:22,998 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-02-15 11:02:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:22,998 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-02-15 11:02:22,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:02:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-02-15 11:02:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:02:23,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:23,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:23,006 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-02-15 11:02:23,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:23,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:23,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:23,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:23,041 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-15 11:02:23,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:23,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:23,042 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:02:23,043 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-02-15 11:02:23,044 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:23,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:23,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:23,046 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:02:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:23,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:23,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:23,046 INFO 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-15 11:02:23,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:23,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:23,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:23,066 INFO L478 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 38 treesize of output 37 [2019-02-15 11:02:23,069 INFO L478 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 37 treesize of output 36 [2019-02-15 11:02:23,073 INFO L478 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 36 treesize of output 35 [2019-02-15 11:02:23,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-02-15 11:02:23,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-02-15 11:02:23,146 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,162 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,231 INFO L478 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-15 11:02:23,234 INFO L478 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-15 11:02:23,239 INFO L478 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-15 11:02:23,250 INFO L478 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-15 11:02:23,259 INFO L478 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-15 11:02:23,269 INFO L478 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-15 11:02:23,269 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,294 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,305 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,326 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,336 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,365 INFO L267 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-15 11:02:23,365 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-02-15 11:02:23,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,412 INFO L478 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-15 11:02:23,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-15 11:02:23,778 INFO L267 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-15 11:02:23,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:369 [2019-02-15 11:02:23,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:23,878 INFO L478 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 42 [2019-02-15 11:02:23,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:23,890 INFO L267 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-15 11:02:23,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-15 11:02:23,904 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-15 11:02:23,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:23,914 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-15 11:02:23,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:23,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-15 11:02:23,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:23,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:02:23,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:02:23,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:02:23,933 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-02-15 11:02:33,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:33,617 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-02-15 11:02:33,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:02:33,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:02:33,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:33,652 INFO L225 Difference]: With dead ends: 10441 [2019-02-15 11:02:33,652 INFO L226 Difference]: Without dead ends: 10440 [2019-02-15 11:02:33,653 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-15 11:02:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-02-15 11:02:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-02-15 11:02:43,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-02-15 11:02:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-02-15 11:02:43,801 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-02-15 11:02:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:02:43,801 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-02-15 11:02:43,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:02:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-02-15 11:02:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:02:43,811 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:02:43,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:02:43,812 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:02:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-02-15 11:02:43,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:02:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:43,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:43,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:02:43,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:02:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:43,961 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-02-15 11:02:43,997 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-15 11:02:43,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:43,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:02:43,998 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:02:43,998 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-02-15 11:02:43,999 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:02:43,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:02:44,001 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:02:44,001 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:02:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:02:44,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:02:44,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:02:44,002 INFO 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-15 11:02:44,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:02:44,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:02:44,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:02:44,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:02:44,019 INFO L478 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-15 11:02:44,152 INFO L303 Elim1Store]: Index analysis took 132 ms [2019-02-15 11:02:44,152 INFO L478 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-15 11:02:44,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,158 INFO L478 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-15 11:02:44,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,166 INFO L478 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-15 11:02:44,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,176 INFO L478 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-15 11:02:44,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,186 INFO L478 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-15 11:02:44,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,223 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,244 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,312 INFO L478 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 63 treesize of output 56 [2019-02-15 11:02:44,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,331 INFO L478 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 53 treesize of output 63 [2019-02-15 11:02:44,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:02:44,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,422 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:02:44,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,480 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,481 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:02:44,488 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,511 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,534 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,557 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,623 INFO L267 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-15 11:02:44,623 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:02:44,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,655 INFO L478 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-15 11:02:44,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,695 INFO L267 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-15 11:02:44,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:02:44,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,729 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:44,730 INFO L478 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 102 [2019-02-15 11:02:44,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:02:44,772 INFO L267 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-15 11:02:44,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-02-15 11:02:44,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:02:44,807 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:02:44,816 INFO L478 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 108 [2019-02-15 11:02:44,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:02:44,945 INFO L267 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-15 11:02:44,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-02-15 11:02:45,059 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-15 11:02:45,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:02:45,096 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-15 11:02:45,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:02:45,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:02:45,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:02:45,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:02:45,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:02:45,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:02:45,114 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-02-15 11:02:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:02:55,097 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-02-15 11:02:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:02:55,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:02:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:02:55,132 INFO L225 Difference]: With dead ends: 10427 [2019-02-15 11:02:55,132 INFO L226 Difference]: Without dead ends: 10426 [2019-02-15 11:02:55,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:02:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-02-15 11:03:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-02-15 11:03:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-02-15 11:03:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-02-15 11:03:05,718 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-02-15 11:03:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:05,719 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-02-15 11:03:05,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:03:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-02-15 11:03:05,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:03:05,729 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:05,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:03:05,729 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:05,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-02-15 11:03:05,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:05,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:05,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:05,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:05,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:05,837 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-15 11:03:05,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:05,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:05,837 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:03:05,837 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-02-15 11:03:05,838 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:03:05,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:03:05,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:03:05,839 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:03:05,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:05,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:03:05,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:05,840 INFO 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-15 11:03:05,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:05,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:03:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:05,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:05,867 INFO L478 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-15 11:03:05,870 INFO L478 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-15 11:03:05,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,876 INFO L478 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-15 11:03:05,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,883 INFO L478 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-15 11:03:05,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:05,892 INFO L478 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-15 11:03:05,902 INFO L478 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-15 11:03:05,902 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,928 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:05,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,011 INFO L478 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 43 treesize of output 39 [2019-02-15 11:03:06,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,025 INFO L478 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 36 treesize of output 49 [2019-02-15 11:03:06,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:03:06,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:03:06,105 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,119 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,133 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,175 INFO L267 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-15 11:03:06,175 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-15 11:03:06,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,221 INFO L478 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-15 11:03:06,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,238 INFO L267 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-15 11:03:06,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:03:06,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,264 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:06,265 INFO L478 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 60 [2019-02-15 11:03:06,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,284 INFO L267 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-15 11:03:06,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-15 11:03:06,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,310 INFO L478 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 61 [2019-02-15 11:03:06,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,329 INFO L267 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-15 11:03:06,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-15 11:03:06,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:06,356 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:06,357 INFO L478 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 75 [2019-02-15 11:03:06,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:06,378 INFO L267 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-15 11:03:06,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-15 11:03:06,399 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-15 11:03:06,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:06,458 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-15 11:03:06,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:06,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:03:06,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:06,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:03:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:03:06,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:03:06,478 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-02-15 11:03:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:03:17,270 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-02-15 11:03:17,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:03:17,271 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:03:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:03:17,310 INFO L225 Difference]: With dead ends: 11408 [2019-02-15 11:03:17,310 INFO L226 Difference]: Without dead ends: 11406 [2019-02-15 11:03:17,313 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-15 11:03:17,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-02-15 11:03:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-02-15 11:03:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-02-15 11:03:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-02-15 11:03:28,352 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-02-15 11:03:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:28,353 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-02-15 11:03:28,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:03:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-02-15 11:03:28,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:03:28,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:28,364 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:03:28,364 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-02-15 11:03:28,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:28,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:28,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:28,532 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-15 11:03:28,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:28,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:28,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:03:28,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:03:28,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:28,534 INFO 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-15 11:03:28,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:03:28,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:03:28,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-15 11:03:28,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:03:28,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:28,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:03:28,589 INFO L478 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-15 11:03:28,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,662 INFO L478 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-15 11:03:28,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,759 INFO L478 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-15 11:03:28,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,869 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-02-15 11:03:28,870 INFO L478 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-15 11:03:28,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,931 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:28,932 INFO L478 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-15 11:03:28,932 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:28,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:28,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:03:29,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:03:29,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,152 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:03:29,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,207 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:03:29,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:03:29,276 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,301 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,326 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,350 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,375 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,419 INFO L267 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-15 11:03:29,419 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:03:29,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,455 INFO L478 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-15 11:03:29,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,497 INFO L267 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-15 11:03:29,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:03:29,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,524 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,531 INFO L478 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 113 [2019-02-15 11:03:29,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,576 INFO L267 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-15 11:03:29,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-02-15 11:03:29,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,616 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:29,617 INFO L478 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 129 [2019-02-15 11:03:29,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,666 INFO L267 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-15 11:03:29,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-02-15 11:03:29,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,706 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:29,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,708 INFO L478 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 122 [2019-02-15 11:03:29,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,756 INFO L267 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-15 11:03:29,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-02-15 11:03:29,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,808 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,811 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,813 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,814 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:29,816 INFO L478 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 125 [2019-02-15 11:03:29,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:29,865 INFO L267 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-15 11:03:29,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-02-15 11:03:29,892 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-15 11:03:29,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:29,965 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-15 11:03:29,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:29,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-15 11:03:29,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:29,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:03:29,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:03:29,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-02-15 11:03:29,984 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-02-15 11:03:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:03:44,511 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-02-15 11:03:44,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 11:03:44,511 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:03:44,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:03:44,565 INFO L225 Difference]: With dead ends: 14692 [2019-02-15 11:03:44,565 INFO L226 Difference]: Without dead ends: 14688 [2019-02-15 11:03:44,568 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-15 11:03:44,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-02-15 11:03:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-02-15 11:03:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-02-15 11:03:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-02-15 11:03:57,864 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-02-15 11:03:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:03:57,864 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-02-15 11:03:57,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:03:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-02-15 11:03:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:03:57,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:03:57,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:03:57,876 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:03:57,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:57,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-02-15 11:03:57,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:03:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:57,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:03:57,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:03:57,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:03:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:58,098 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-15 11:03:58,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:58,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:03:58,099 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:03:58,099 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-02-15 11:03:58,100 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:03:58,100 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:03:58,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:03:58,102 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:03:58,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:03:58,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:03:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:03:58,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:03:58,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:03:58,111 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:03:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:03:58,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:03:58,138 INFO L478 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-15 11:03:58,141 INFO L478 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-15 11:03:58,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,146 INFO L478 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-15 11:03:58,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,154 INFO L478 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-15 11:03:58,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,163 INFO L478 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-15 11:03:58,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,174 INFO L478 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-15 11:03:58,174 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,257 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,296 INFO L478 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 63 treesize of output 56 [2019-02-15 11:03:58,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,316 INFO L478 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 53 treesize of output 63 [2019-02-15 11:03:58,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:03:58,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,407 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:03:58,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:03:58,472 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,495 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,517 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,540 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,565 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,606 INFO L267 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-15 11:03:58,606 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:03:58,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,638 INFO L478 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-15 11:03:58,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,677 INFO L267 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-15 11:03:58,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-02-15 11:03:58,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,774 INFO L478 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 109 [2019-02-15 11:03:58,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,816 INFO L267 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-15 11:03:58,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-02-15 11:03:58,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,849 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:03:58,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:03:58,850 INFO L478 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 118 [2019-02-15 11:03:58,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:03:58,893 INFO L267 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-15 11:03:58,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-02-15 11:03:58,915 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-15 11:03:58,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:03:58,948 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-15 11:03:58,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:03:58,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:03:58,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:03:58,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:03:58,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:03:58,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:03:58,968 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-02-15 11:04:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:04:11,419 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-02-15 11:04:11,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:04:11,419 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:04:11,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:04:11,466 INFO L225 Difference]: With dead ends: 13016 [2019-02-15 11:04:11,466 INFO L226 Difference]: Without dead ends: 13015 [2019-02-15 11:04:11,470 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-15 11:04:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-02-15 11:04:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-02-15 11:04:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-15 11:04:24,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-15 11:04:24,810 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-15 11:04:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:04:24,810 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-15 11:04:24,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:04:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-15 11:04:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:04:24,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:04:24,822 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:04:24,822 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:04:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-02-15 11:04:24,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:04:24,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:24,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:24,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:24,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:04:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:25,064 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-02-15 11:04:25,074 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-15 11:04:25,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:25,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:04:25,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:04:25,075 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-02-15 11:04:25,076 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:04:25,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:04:25,078 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:04:25,078 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:04:25,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:25,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:04:25,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:25,079 INFO 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-15 11:04:25,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:25,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:04:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:25,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:04:25,097 INFO L478 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-15 11:04:25,100 INFO L478 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-15 11:04:25,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,107 INFO L478 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-15 11:04:25,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,115 INFO L478 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-15 11:04:25,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,124 INFO L478 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-15 11:04:25,133 INFO L478 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-15 11:04:25,134 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,160 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,180 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,241 INFO L478 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 43 treesize of output 39 [2019-02-15 11:04:25,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,257 INFO L478 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 36 treesize of output 49 [2019-02-15 11:04:25,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:04:25,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:04:25,335 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,349 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,363 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,378 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,407 INFO L267 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-15 11:04:25,407 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-02-15 11:04:25,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,469 INFO L478 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 72 [2019-02-15 11:04:25,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:04:25,564 INFO L267 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-15 11:04:25,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-02-15 11:04:25,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:25,605 INFO L478 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 57 [2019-02-15 11:04:25,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:25,625 INFO L267 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-15 11:04:25,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-02-15 11:04:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:04:25,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:04:25,658 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-15 11:04:25,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:04:25,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-15 11:04:25,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:04:25,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-15 11:04:25,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-15 11:04:25,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-15 11:04:25,677 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-02-15 11:04:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:04:38,020 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-02-15 11:04:38,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:04:38,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-15 11:04:38,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:04:38,064 INFO L225 Difference]: With dead ends: 12974 [2019-02-15 11:04:38,065 INFO L226 Difference]: Without dead ends: 12973 [2019-02-15 11:04:38,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:04:38,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-02-15 11:04:51,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-02-15 11:04:51,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-02-15 11:04:51,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-02-15 11:04:51,153 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-02-15 11:04:51,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:04:51,153 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-02-15 11:04:51,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-15 11:04:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-02-15 11:04:51,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:04:51,163 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:04:51,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:04:51,164 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:04:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:51,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-02-15 11:04:51,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:04:51,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:51,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:51,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:04:51,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:04:51,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:51,211 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-15 11:04:51,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:51,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:04:51,212 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:04:51,212 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-02-15 11:04:51,213 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:04:51,213 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:04:51,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:04:51,215 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:04:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:04:51,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:04:51,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:04:51,215 INFO 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-15 11:04:51,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:04:51,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:04:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:04:51,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:04:51,235 INFO L478 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-15 11:04:51,237 INFO L478 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-15 11:04:51,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,243 INFO L478 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-15 11:04:51,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,251 INFO L478 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-15 11:04:51,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,259 INFO L478 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-15 11:04:51,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,268 INFO L478 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-15 11:04:51,268 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,305 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,324 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,352 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,392 INFO L478 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 63 treesize of output 56 [2019-02-15 11:04:51,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,411 INFO L478 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 53 treesize of output 63 [2019-02-15 11:04:51,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:04:51,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,502 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:04:51,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:04:51,567 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,588 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,611 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,633 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,658 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,703 INFO L267 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-15 11:04:51,703 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:04:51,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,745 INFO L478 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 97 [2019-02-15 11:04:51,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:04:51,882 INFO L267 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-15 11:04:51,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-02-15 11:04:51,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:51,939 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:04:51,940 INFO L478 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 72 [2019-02-15 11:04:51,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:51,975 INFO L267 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-15 11:04:51,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-02-15 11:04:52,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:04:52,008 INFO L478 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 78 [2019-02-15 11:04:52,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:04:52,040 INFO L267 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-15 11:04:52,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-15 11:04:52,061 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-15 11:04:52,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:04:52,095 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-15 11:04:52,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:04:52,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:04:52,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:04:52,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:04:52,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:04:52,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:04:52,115 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-02-15 11:05:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:05:04,953 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-02-15 11:05:04,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:05:04,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:05:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:05:05,000 INFO L225 Difference]: With dead ends: 13106 [2019-02-15 11:05:05,000 INFO L226 Difference]: Without dead ends: 13105 [2019-02-15 11:05:05,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-02-15 11:05:05,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-02-15 11:05:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-02-15 11:05:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-02-15 11:05:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-02-15 11:05:18,665 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-02-15 11:05:18,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:05:18,666 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-02-15 11:05:18,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:05:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-02-15 11:05:18,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:05:18,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:05:18,676 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:05:18,676 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:05:18,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:05:18,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-02-15 11:05:18,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:05:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:18,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:05:18,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:18,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:05:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:05:18,791 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-15 11:05:18,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:18,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:05:18,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:05:18,791 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-02-15 11:05:18,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:05:18,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:05:18,794 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:05:18,794 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:05:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:05:18,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:05:18,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:18,795 INFO 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-15 11:05:18,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:05:18,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:05:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:05:18,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:05:18,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:05:18,831 INFO L478 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-15 11:05:18,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,835 INFO L478 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-15 11:05:18,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,843 INFO L478 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-15 11:05:18,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,850 INFO L478 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-15 11:05:18,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,859 INFO L478 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-15 11:05:18,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:18,897 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:18,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:18,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:18,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:18,964 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:18,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:18,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:05:19,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:05:19,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,081 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:05:19,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,137 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:05:19,195 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:05:19,203 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,228 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,252 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,277 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,302 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,345 INFO L267 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-15 11:05:19,345 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:05:19,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,386 INFO L478 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 97 [2019-02-15 11:05:19,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,430 INFO L267 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-15 11:05:19,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:05:19,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,490 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:19,491 INFO L478 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 105 [2019-02-15 11:05:19,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,536 INFO L267 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-15 11:05:19,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-02-15 11:05:19,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,579 INFO L478 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 111 [2019-02-15 11:05:19,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,626 INFO L267 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-15 11:05:19,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-02-15 11:05:19,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:19,670 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:19,671 INFO L478 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 123 [2019-02-15 11:05:19,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:19,717 INFO L267 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-15 11:05:19,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-15 11:05:19,750 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-15 11:05:19,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:05:19,810 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-15 11:05:19,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:05:19,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 11:05:19,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:05:19,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 11:05:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 11:05:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:05:19,830 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-02-15 11:05:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:05:34,927 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-02-15 11:05:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:05:34,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-15 11:05:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:05:34,971 INFO L225 Difference]: With dead ends: 13278 [2019-02-15 11:05:34,971 INFO L226 Difference]: Without dead ends: 13277 [2019-02-15 11:05:34,974 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-15 11:05:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-02-15 11:05:48,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-02-15 11:05:48,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-02-15 11:05:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-02-15 11:05:48,396 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-02-15 11:05:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:05:48,396 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-02-15 11:05:48,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 11:05:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-02-15 11:05:48,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:05:48,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:05:48,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:05:48,407 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:05:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:05:48,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-02-15 11:05:48,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:05:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:48,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:05:48,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:05:48,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:05:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:05:48,543 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-15 11:05:48,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:48,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:05:48,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:05:48,544 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-02-15 11:05:48,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:05:48,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:05:48,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:05:48,546 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-15 11:05:48,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:05:48,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:05:48,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:05:48,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:05:48,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:05:48,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:05:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:05:48,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:05:48,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:05:48,585 INFO L478 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-15 11:05:48,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,588 INFO L478 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-15 11:05:48,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,595 INFO L478 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-15 11:05:48,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,600 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,601 INFO L478 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-15 11:05:48,608 INFO L478 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-15 11:05:48,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,637 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,656 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,673 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:05:48,757 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:05:48,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,796 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:05:48,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 11:05:48,843 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,857 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,872 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:05:48,918 INFO L267 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-15 11:05:48,918 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:05:48,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:48,972 INFO L478 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 72 [2019-02-15 11:05:48,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:49,001 INFO L267 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-15 11:05:49,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-15 11:05:49,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,028 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,033 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:49,033 INFO L478 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 80 [2019-02-15 11:05:49,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:49,064 INFO L267 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-15 11:05:49,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-15 11:05:49,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,096 INFO L478 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 86 [2019-02-15 11:05:49,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:49,128 INFO L267 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-15 11:05:49,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-15 11:05:49,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:05:49,163 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:05:49,164 INFO L478 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 98 [2019-02-15 11:05:49,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:05:49,195 INFO L267 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-15 11:05:49,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-15 11:05:49,222 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-15 11:05:49,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:05:49,279 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-15 11:05:49,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:05:49,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-15 11:05:49,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:05:49,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:05:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:05:49,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:05:49,300 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-02-15 11:06:07,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:07,558 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-02-15 11:06:07,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:06:07,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:06:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:07,622 INFO L225 Difference]: With dead ends: 17581 [2019-02-15 11:06:07,622 INFO L226 Difference]: Without dead ends: 17580 [2019-02-15 11:06:07,626 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-15 11:06:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-02-15 11:06:18,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-02-15 11:06:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-15 11:06:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-15 11:06:18,420 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-15 11:06:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:06:18,421 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-15 11:06:18,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:06:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-15 11:06:18,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:06:18,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:06:18,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:06:18,429 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:06:18,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-02-15 11:06:18,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:06:18,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:18,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:18,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:18,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:06:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:18,480 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-15 11:06:18,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:18,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:06:18,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:06:18,480 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-02-15 11:06:18,481 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:06:18,481 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:06:18,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:06:18,483 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:06:18,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:18,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:06:18,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:18,483 INFO 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-15 11:06:18,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:18,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:06:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:18,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:06:18,500 INFO L478 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-15 11:06:18,509 INFO L478 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-15 11:06:18,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,514 INFO L478 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-15 11:06:18,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,522 INFO L478 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-15 11:06:18,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,531 INFO L478 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-15 11:06:18,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,541 INFO L478 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-15 11:06:18,541 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,579 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,600 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,669 INFO L478 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 63 treesize of output 56 [2019-02-15 11:06:18,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,686 INFO L478 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 53 treesize of output 63 [2019-02-15 11:06:18,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:06:18,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,774 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:06:18,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:18,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:06:18,839 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,862 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,885 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,908 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:18,974 INFO L267 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-15 11:06:18,975 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:06:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:19,008 INFO L478 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 97 [2019-02-15 11:06:19,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:06:19,147 INFO L267 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-15 11:06:19,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-15 11:06:19,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:19,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:19,216 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:19,217 INFO L478 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 80 [2019-02-15 11:06:19,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:19,248 INFO L267 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-15 11:06:19,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-02-15 11:06:19,268 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-15 11:06:19,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:06:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:06:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:06:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:06:19,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:06:19,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:06:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:06:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:06:19,308 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-02-15 11:06:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:29,192 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-02-15 11:06:29,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:06:29,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:06:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:29,227 INFO L225 Difference]: With dead ends: 9947 [2019-02-15 11:06:29,227 INFO L226 Difference]: Without dead ends: 9946 [2019-02-15 11:06:29,229 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-15 11:06:29,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-02-15 11:06:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-02-15 11:06:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-02-15 11:06:40,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-02-15 11:06:40,083 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-02-15 11:06:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:06:40,084 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-02-15 11:06:40,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:06:40,084 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-02-15 11:06:40,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:06:40,092 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:06:40,092 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-15 11:06:40,092 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:06:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:06:40,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-02-15 11:06:40,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:06:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:06:40,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:06:40,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:06:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:06:40,148 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-15 11:06:40,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:40,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:06:40,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:06:40,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:06:40,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:06:40,149 INFO 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-15 11:06:40,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 11:06:40,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 11:06:40,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 11:06:40,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:06:40,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:06:40,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:06:40,188 INFO L478 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-15 11:06:40,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,192 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,193 INFO L478 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-15 11:06:40,196 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,198 INFO L478 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-15 11:06:40,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,206 INFO L478 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-15 11:06:40,216 INFO L478 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-15 11:06:40,216 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,243 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,281 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-15 11:06:40,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-15 11:06:40,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,401 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,401 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-15 11:06:40,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 41 [2019-02-15 11:06:40,448 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,464 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,479 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,494 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,525 INFO L267 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-15 11:06:40,525 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-02-15 11:06:40,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,634 INFO L478 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 81 [2019-02-15 11:06:40,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:06:40,737 INFO L267 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-15 11:06:40,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-02-15 11:06:40,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,843 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:40,844 INFO L478 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 72 [2019-02-15 11:06:40,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:40,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,930 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:40,959 INFO L478 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 107 [2019-02-15 11:06:40,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-02-15 11:06:41,264 INFO L267 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-15 11:06:41,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-02-15 11:06:41,408 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-02-15 11:06:41,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,424 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:41,424 INFO L478 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 93 [2019-02-15 11:06:41,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:41,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,567 INFO L478 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 98 [2019-02-15 11:06:41,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:41,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,701 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:41,702 INFO L478 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 113 [2019-02-15 11:06:41,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:41,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:41,965 INFO L478 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-15 11:06:41,966 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:42,043 INFO L267 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-15 11:06:42,044 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-02-15 11:06:42,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,124 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,124 INFO L478 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 78 [2019-02-15 11:06:42,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:42,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,241 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,242 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,247 INFO L478 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 98 [2019-02-15 11:06:42,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:42,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,378 INFO L478 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 108 [2019-02-15 11:06:42,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:42,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,507 INFO L478 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 100 [2019-02-15 11:06:42,508 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:42,602 INFO L267 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-15 11:06:42,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-02-15 11:06:42,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,705 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:42,706 INFO L478 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 123 [2019-02-15 11:06:42,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:42,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,843 INFO L478 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 118 [2019-02-15 11:06:42,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:42,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,981 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:06:42,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:42,983 INFO L478 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 125 [2019-02-15 11:06:42,983 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:43,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:43,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:43,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:43,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:43,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:43,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:06:43,101 INFO L478 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 88 [2019-02-15 11:06:43,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:06:43,178 INFO L267 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-15 11:06:43,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-02-15 11:06:43,278 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-15 11:06:43,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:06:43,421 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-15 11:06:43,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:06:43,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-02-15 11:06:43,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:06:43,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-15 11:06:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-15 11:06:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-02-15 11:06:43,441 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-02-15 11:06:43,633 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-02-15 11:06:43,906 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-02-15 11:06:44,197 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 72 [2019-02-15 11:06:45,365 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-02-15 11:06:46,840 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-02-15 11:06:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:06:58,800 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-02-15 11:06:58,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 11:06:58,800 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-02-15 11:06:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:06:58,843 INFO L225 Difference]: With dead ends: 12394 [2019-02-15 11:06:58,843 INFO L226 Difference]: Without dead ends: 12392 [2019-02-15 11:06:58,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-02-15 11:06:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-02-15 11:07:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-02-15 11:07:07,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-02-15 11:07:07,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-02-15 11:07:07,721 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-02-15 11:07:07,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:07:07,721 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-02-15 11:07:07,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-15 11:07:07,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-02-15 11:07:07,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:07:07,727 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:07:07,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:07:07,727 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:07:07,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:07:07,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-02-15 11:07:07,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:07:07,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:07:07,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:07:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:07:07,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:07:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:07:07,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-15 11:07:07,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:07:07,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:07:07,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:07:07,799 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-02-15 11:07:07,799 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:07:07,800 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:07:07,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:07:07,801 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:07:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:07:07,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:07:07,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:07:07,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-15 11:07:07,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:07:07,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:07:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:07:07,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:07:07,818 INFO L478 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-15 11:07:07,822 INFO L478 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-15 11:07:07,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,829 INFO L478 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-15 11:07:07,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,836 INFO L478 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-15 11:07:07,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,843 INFO L478 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-15 11:07:07,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,853 INFO L478 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-15 11:07:07,853 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:07,890 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:07,910 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:07,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:07,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:07,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:07,978 INFO L478 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 63 treesize of output 56 [2019-02-15 11:07:07,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:07,996 INFO L478 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 53 treesize of output 63 [2019-02-15 11:07:08,030 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:07:08,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,087 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:07:08,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:07:08,153 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,176 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,199 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,222 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,247 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,287 INFO L267 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-15 11:07:08,288 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:07:08,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,329 INFO L478 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 97 [2019-02-15 11:07:08,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:07:08,467 INFO L267 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-15 11:07:08,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-02-15 11:07:08,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,569 INFO L478 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 68 treesize of output 90 [2019-02-15 11:07:08,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,658 INFO L478 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 127 [2019-02-15 11:07:08,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,736 INFO L267 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-15 11:07:08,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-02-15 11:07:08,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,788 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:07:08,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,790 INFO L478 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 88 [2019-02-15 11:07:08,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,874 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:07:08,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:08,876 INFO L478 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 138 [2019-02-15 11:07:08,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:08,958 INFO L267 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-15 11:07:08,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-02-15 11:07:10,274 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 67 [2019-02-15 11:07:10,279 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-15 11:07:10,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:07:10,314 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-15 11:07:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:07:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:07:10,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:07:10,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:07:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:07:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:07:10,333 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-02-15 11:07:10,506 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-02-15 11:07:12,295 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-02-15 11:07:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:07:20,168 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-02-15 11:07:20,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:07:20,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:07:20,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:07:20,191 INFO L225 Difference]: With dead ends: 7367 [2019-02-15 11:07:20,191 INFO L226 Difference]: Without dead ends: 7366 [2019-02-15 11:07:20,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-15 11:07:20,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-02-15 11:07:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-02-15 11:07:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-02-15 11:07:29,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-02-15 11:07:29,817 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-02-15 11:07:29,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:07:29,817 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-02-15 11:07:29,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:07:29,817 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-02-15 11:07:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:07:29,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:07:29,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:07:29,823 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:07:29,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:07:29,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-02-15 11:07:29,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:07:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:07:29,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:07:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:07:29,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:07:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:07:29,962 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-15 11:07:29,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:07:29,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:07:29,963 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 11:07:29,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 11:07:29,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:07:29,963 INFO 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-15 11:07:29,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 11:07:29,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 11:07:29,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 11:07:29,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 11:07:29,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:07:29,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-02-15 11:07:29,999 INFO L478 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-15 11:07:30,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,004 INFO L478 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-15 11:07:30,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,009 INFO L478 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-15 11:07:30,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,014 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,016 INFO L478 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-15 11:07:30,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,025 INFO L478 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-15 11:07:30,025 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,064 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,087 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:07:30,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,202 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:07:30,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,246 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:07:30,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,300 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:07:30,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:07:30,368 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,393 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,417 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,442 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,467 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,511 INFO L267 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-15 11:07:30,512 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-02-15 11:07:30,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,548 INFO L478 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 97 [2019-02-15 11:07:30,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,592 INFO L267 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-15 11:07:30,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-02-15 11:07:30,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,628 INFO L478 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 111 [2019-02-15 11:07:30,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,677 INFO L267 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-15 11:07:30,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-02-15 11:07:30,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:30,714 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:07:30,714 INFO L478 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 123 [2019-02-15 11:07:30,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:30,760 INFO L267 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-15 11:07:30,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-02-15 11:07:32,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:07:32,804 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:07:32,804 INFO L478 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 123 [2019-02-15 11:07:32,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:07:32,851 INFO L267 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-15 11:07:32,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-02-15 11:07:32,880 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-15 11:07:32,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:07:32,929 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-15 11:07:32,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:07:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-15 11:07:32,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:07:32,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:07:32,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:07:32,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=133, Unknown=1, NotChecked=0, Total=210 [2019-02-15 11:07:32,948 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-02-15 11:07:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:07:48,700 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-02-15 11:07:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:07:48,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:07:48,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:07:48,733 INFO L225 Difference]: With dead ends: 9936 [2019-02-15 11:07:48,734 INFO L226 Difference]: Without dead ends: 9935 [2019-02-15 11:07:48,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=116, Invalid=225, Unknown=1, NotChecked=0, Total=342 [2019-02-15 11:07:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-02-15 11:08:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-02-15 11:08:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-02-15 11:08:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-02-15 11:08:02,607 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-02-15 11:08:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:08:02,607 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-02-15 11:08:02,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:08:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-02-15 11:08:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:08:02,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:08:02,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:08:02,615 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:08:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:08:02,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-02-15 11:08:02,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:08:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:08:02,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 11:08:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:08:02,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:08:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:08:02,702 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-15 11:08:02,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:08:02,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:08:02,703 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:08:02,703 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-02-15 11:08:02,704 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:08:02,704 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:08:02,705 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:08:02,705 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:08:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:08:02,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:08:02,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:08:02,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 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-15 11:08:02,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:08:02,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:08:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:08:02,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:08:02,726 INFO L478 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 63 treesize of output 56 [2019-02-15 11:08:02,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,744 INFO L478 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 53 treesize of output 63 [2019-02-15 11:08:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:08:02,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,833 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:08:02,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:02,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:08:02,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:08:02,921 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:02,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:02,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:02,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,026 INFO L478 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-15 11:08:03,030 INFO L478 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-15 11:08:03,034 INFO L478 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-15 11:08:03,037 INFO L478 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-15 11:08:03,039 INFO L478 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-15 11:08:03,043 INFO L478 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-15 11:08:03,043 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,074 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,092 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,106 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,117 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,129 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,169 INFO L267 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-15 11:08:03,169 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-02-15 11:08:03,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,209 INFO L478 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 97 [2019-02-15 11:08:03,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:08:03,348 INFO L267 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-15 11:08:03,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-02-15 11:08:03,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,397 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:08:03,397 INFO L478 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 80 [2019-02-15 11:08:03,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,427 INFO L267 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-15 11:08:03,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-02-15 11:08:03,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:03,455 INFO L478 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 86 [2019-02-15 11:08:03,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:08:03,485 INFO L267 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-15 11:08:03,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-02-15 11:08:03,507 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-15 11:08:03,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:08:03,532 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-15 11:08:03,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:08:03,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-15 11:08:03,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:08:03,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:08:03,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:08:03,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:08:03,552 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-02-15 11:08:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:08:17,932 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-02-15 11:08:17,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 11:08:17,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:08:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:08:17,961 INFO L225 Difference]: With dead ends: 9235 [2019-02-15 11:08:17,961 INFO L226 Difference]: Without dead ends: 9232 [2019-02-15 11:08:17,963 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-15 11:08:17,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-02-15 11:08:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-02-15 11:08:32,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-02-15 11:08:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-02-15 11:08:32,544 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-02-15 11:08:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:08:32,544 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-02-15 11:08:32,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:08:32,544 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-02-15 11:08:32,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:08:32,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:08:32,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:08:32,552 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:08:32,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:08:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-02-15 11:08:32,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:08:32,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:08:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:08:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:08:32,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:08:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:08:32,616 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-15 11:08:32,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:08:32,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:08:32,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:08:32,616 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-02-15 11:08:32,617 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:08:32,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:08:32,618 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:08:32,619 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:08:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:08:32,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:08:32,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:08:32,619 INFO 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-15 11:08:32,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:08:32,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:08:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:08:32,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:08:32,650 INFO L478 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 43 treesize of output 39 [2019-02-15 11:08:32,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,671 INFO L478 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 36 treesize of output 49 [2019-02-15 11:08:32,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:08:32,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,817 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:32,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:08:32,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,883 INFO L478 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-15 11:08:32,887 INFO L478 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-15 11:08:32,890 INFO L478 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-15 11:08:32,893 INFO L478 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-15 11:08:32,896 INFO L478 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-15 11:08:32,905 INFO L478 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-15 11:08:32,906 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,928 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,945 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,959 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,970 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:32,981 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:08:33,009 INFO L267 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-15 11:08:33,010 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:08:33,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:33,056 INFO L478 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 72 [2019-02-15 11:08:33,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:08:33,145 INFO L267 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-15 11:08:33,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-02-15 11:08:33,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:33,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:33,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:33,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:08:33,186 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:08:33,187 INFO L478 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 59 [2019-02-15 11:08:33,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:08:33,206 INFO L267 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-15 11:08:33,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-02-15 11:08:33,228 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-15 11:08:33,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:08:33,250 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-15 11:08:33,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:08:33,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:08:33,269 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:08:33,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:08:33,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:08:33,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:08:33,269 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-02-15 11:08:47,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:08:47,115 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-02-15 11:08:47,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:08:47,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:08:47,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:08:47,145 INFO L225 Difference]: With dead ends: 9065 [2019-02-15 11:08:47,145 INFO L226 Difference]: Without dead ends: 9064 [2019-02-15 11:08:47,147 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-15 11:08:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-02-15 11:09:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-02-15 11:09:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-02-15 11:09:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-02-15 11:09:01,628 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-02-15 11:09:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:09:01,629 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-02-15 11:09:01,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 11:09:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-02-15 11:09:01,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:09:01,636 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:09:01,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:09:01,636 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:09:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:09:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-02-15 11:09:01,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:09:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:09:01,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:09:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:09:01,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:09:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:09:01,711 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-15 11:09:01,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:09:01,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:09:01,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:09:01,712 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-02-15 11:09:01,712 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:09:01,712 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:09:01,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:09:01,714 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:09:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:09:01,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:09:01,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:09:01,714 INFO 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-15 11:09:01,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:09:01,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:09:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:09:01,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:09:01,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:09:01,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:09:01,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,839 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:09:01,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,900 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:09:01,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:01,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:09:01,973 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,130 INFO L478 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-15 11:09:02,135 INFO L478 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-15 11:09:02,137 INFO L478 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-15 11:09:02,139 INFO L478 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-15 11:09:02,141 INFO L478 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-15 11:09:02,143 INFO L478 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-15 11:09:02,144 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,179 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,199 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,214 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,226 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,238 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,281 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-02-15 11:09:02,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,332 INFO L478 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 97 [2019-02-15 11:09:02,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,374 INFO L267 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-15 11:09:02,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-02-15 11:09:02,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,466 INFO L478 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 103 [2019-02-15 11:09:02,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,510 INFO L267 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-15 11:09:02,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-02-15 11:09:02,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,555 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,556 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:09:02,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,558 INFO L478 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 118 [2019-02-15 11:09:02,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,606 INFO L267 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-15 11:09:02,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-02-15 11:09:02,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,647 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:09:02,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,649 INFO L478 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 124 [2019-02-15 11:09:02,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,698 INFO L267 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-15 11:09:02,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-02-15 11:09:02,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,738 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,739 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,740 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:02,749 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:09:02,749 INFO L478 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 127 [2019-02-15 11:09:02,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:02,798 INFO L267 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-15 11:09:02,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-02-15 11:09:02,823 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-15 11:09:02,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:09:02,918 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-15 11:09:02,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:09:02,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 11:09:02,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:09:02,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:09:02,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:09:02,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:09:02,937 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-02-15 11:09:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:09:24,661 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-02-15 11:09:24,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 11:09:24,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 11:09:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:09:24,691 INFO L225 Difference]: With dead ends: 9411 [2019-02-15 11:09:24,691 INFO L226 Difference]: Without dead ends: 9409 [2019-02-15 11:09:24,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=398, Unknown=0, NotChecked=0, Total=600 [2019-02-15 11:09:24,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-02-15 11:09:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-02-15 11:09:38,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-02-15 11:09:38,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-02-15 11:09:38,979 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-02-15 11:09:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:09:38,979 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-02-15 11:09:38,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:09:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-02-15 11:09:38,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:09:38,987 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:09:38,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:09:38,987 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:09:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:09:38,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-02-15 11:09:38,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:09:38,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:09:38,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:09:38,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:09:38,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:09:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:09:39,124 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-15 11:09:39,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:09:39,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:09:39,125 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:09:39,125 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-02-15 11:09:39,125 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:09:39,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:09:39,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:09:39,128 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-15 11:09:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:09:39,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:09:39,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:09:39,128 INFO 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-15 11:09:39,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:09:39,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:09:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:09:39,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:09:39,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-02-15 11:09:39,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-02-15 11:09:39,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,255 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-02-15 11:09:39,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,309 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-02-15 11:09:39,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 61 [2019-02-15 11:09:39,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,406 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,517 INFO L478 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-15 11:09:39,520 INFO L478 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-15 11:09:39,522 INFO L478 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-15 11:09:39,526 INFO L478 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-15 11:09:39,529 INFO L478 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-15 11:09:39,532 INFO L478 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-15 11:09:39,533 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,567 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,584 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,599 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,611 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,622 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,665 INFO L267 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-15 11:09:39,666 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-02-15 11:09:39,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,711 INFO L478 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 97 [2019-02-15 11:09:39,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,755 INFO L267 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-15 11:09:39,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-02-15 11:09:39,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,800 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:09:39,801 INFO L478 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 105 [2019-02-15 11:09:39,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,844 INFO L267 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-15 11:09:39,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-02-15 11:09:39,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,885 INFO L478 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 111 [2019-02-15 11:09:39,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:39,932 INFO L267 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-15 11:09:39,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-02-15 11:09:39,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,970 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:39,975 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:09:39,976 INFO L478 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 124 [2019-02-15 11:09:39,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:40,025 INFO L267 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-15 11:09:40,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-02-15 11:09:40,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,057 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,059 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,060 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,062 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,067 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:09:40,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:09:40,069 INFO L478 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 120 [2019-02-15 11:09:40,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:09:40,116 INFO L267 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-15 11:09:40,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-02-15 11:09:40,146 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-15 11:09:40,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:09:40,224 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-15 11:09:40,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:09:40,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 11:09:40,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:09:40,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 11:09:40,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 11:09:40,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-02-15 11:09:40,243 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-02-15 11:09:55,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:09:55,942 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-02-15 11:09:55,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 11:09:55,942 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-02-15 11:09:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:09:55,971 INFO L225 Difference]: With dead ends: 8797 [2019-02-15 11:09:55,971 INFO L226 Difference]: Without dead ends: 8791 [2019-02-15 11:09:55,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-02-15 11:09:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-02-15 11:10:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-02-15 11:10:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-02-15 11:10:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-02-15 11:10:04,009 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-02-15 11:10:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:10:04,009 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-02-15 11:10:04,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 11:10:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-02-15 11:10:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:10:04,012 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:10:04,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:10:04,012 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:10:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:10:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-02-15 11:10:04,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:10:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:10:04,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:10:04,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:10:04,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:10:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:10:04,054 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-15 11:10:04,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:10:04,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:10:04,055 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:10:04,055 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-02-15 11:10:04,056 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:10:04,056 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:10:04,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:10:04,057 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:10:04,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:10:04,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:10:04,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:10:04,058 INFO 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-15 11:10:04,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:10:04,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:10:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:10:04,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:10:04,076 INFO L478 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 63 treesize of output 56 [2019-02-15 11:10:04,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,096 INFO L478 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 53 treesize of output 63 [2019-02-15 11:10:04,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-02-15 11:10:04,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,188 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-15 11:10:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,244 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,245 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,246 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,248 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-02-15 11:10:04,253 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,277 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,323 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,382 INFO L478 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-15 11:10:04,385 INFO L478 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-15 11:10:04,462 INFO L478 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-15 11:10:04,466 INFO L478 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-15 11:10:04,470 INFO L478 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-15 11:10:04,474 INFO L478 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-15 11:10:04,475 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,506 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,524 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,538 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,549 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,561 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,601 INFO L267 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-15 11:10:04,602 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-02-15 11:10:04,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,633 INFO L478 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 93 [2019-02-15 11:10:04,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,674 INFO L267 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-15 11:10:04,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-02-15 11:10:04,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,708 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,709 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,711 INFO L478 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 107 [2019-02-15 11:10:04,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:04,750 INFO L267 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-15 11:10:04,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-02-15 11:10:04,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:04,789 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:10:04,798 INFO L478 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 134 [2019-02-15 11:10:04,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-15 11:10:04,953 INFO L267 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-15 11:10:04,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-02-15 11:10:04,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 11:10:04,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:10:05,034 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-15 11:10:05,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:10:05,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 11:10:05,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:10:05,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 11:10:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 11:10:05,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-15 11:10:05,053 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-02-15 11:10:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:10:14,816 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-02-15 11:10:14,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 11:10:14,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-15 11:10:14,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:10:14,822 INFO L225 Difference]: With dead ends: 1963 [2019-02-15 11:10:14,822 INFO L226 Difference]: Without dead ends: 1962 [2019-02-15 11:10:14,822 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-15 11:10:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-02-15 11:10:22,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-02-15 11:10:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-02-15 11:10:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-02-15 11:10:22,698 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-02-15 11:10:22,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:10:22,698 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-02-15 11:10:22,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 11:10:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-02-15 11:10:22,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:10:22,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:10:22,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:10:22,702 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:10:22,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:10:22,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-02-15 11:10:22,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:10:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:10:22,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:10:22,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:10:22,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:10:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:10:22,790 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-15 11:10:22,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:10:22,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:10:22,791 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:10:22,791 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-02-15 11:10:22,792 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:10:22,792 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:10:22,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:10:22,794 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-15 11:10:22,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:10:22,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:10:22,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:10:22,794 INFO 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-15 11:10:22,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:10:22,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:10:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:10:22,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:10:22,812 INFO L478 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-15 11:10:22,815 INFO L478 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-15 11:10:22,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,821 INFO L478 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-15 11:10:22,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,827 INFO L478 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-15 11:10:22,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,838 INFO L478 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-15 11:10:22,848 INFO L478 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-15 11:10:22,848 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:22,874 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:22,894 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:22,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:22,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:22,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:22,956 INFO L478 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 43 treesize of output 39 [2019-02-15 11:10:22,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,971 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:22,972 INFO L478 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 36 treesize of output 49 [2019-02-15 11:10:23,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:10:23,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,050 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:10:23,051 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:23,066 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:23,079 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:23,094 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:23,121 INFO L267 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-15 11:10:23,122 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-02-15 11:10:23,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,167 INFO L478 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 51 [2019-02-15 11:10:23,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:23,186 INFO L267 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-15 11:10:23,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-15 11:10:23,206 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,207 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,212 INFO L478 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 65 [2019-02-15 11:10:23,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:23,233 INFO L267 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-15 11:10:23,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-15 11:10:23,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:23,262 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:10:23,263 INFO L478 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 78 [2019-02-15 11:10:23,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:23,286 INFO L267 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-15 11:10:23,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-15 11:10:23,304 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-15 11:10:23,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:10:23,344 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-15 11:10:23,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:10:23,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-02-15 11:10:23,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:10:23,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-15 11:10:23,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-15 11:10:23,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-15 11:10:23,363 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-02-15 11:10:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:10:31,184 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-02-15 11:10:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 11:10:31,185 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-15 11:10:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:10:31,190 INFO L225 Difference]: With dead ends: 2000 [2019-02-15 11:10:31,190 INFO L226 Difference]: Without dead ends: 1999 [2019-02-15 11:10:31,191 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-15 11:10:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-02-15 11:10:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1945. [2019-02-15 11:10:38,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-02-15 11:10:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 13387 transitions. [2019-02-15 11:10:38,971 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 13387 transitions. Word has length 7 [2019-02-15 11:10:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:10:38,971 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 13387 transitions. [2019-02-15 11:10:38,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-15 11:10:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 13387 transitions. [2019-02-15 11:10:38,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:10:38,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:10:38,974 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:10:38,974 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:10:38,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:10:38,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-02-15 11:10:38,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:10:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:10:38,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:10:38,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:10:38,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:10:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:10:38,987 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-15 11:10:38,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:10:38,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:10:38,988 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:10:38,988 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [30], [32], [34], [35] [2019-02-15 11:10:38,988 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:10:38,988 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:10:38,989 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:10:38,989 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 11:10:38,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:10:38,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:10:38,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:10:38,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 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-15 11:10:39,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:10:39,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:10:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:10:39,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:10:39,041 INFO L478 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-15 11:10:39,043 INFO L478 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-15 11:10:39,048 INFO L478 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-15 11:10:39,062 INFO L478 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-15 11:10:39,074 INFO L478 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-15 11:10:39,094 INFO L478 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-15 11:10:39,095 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,105 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,159 INFO L267 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-15 11:10:39,159 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-02-15 11:10:39,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:10:39,165 INFO L478 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-15 11:10:39,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:10:39,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-15 11:10:39,169 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-15 11:10:39,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:10:39,174 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-15 11:10:39,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-15 11:10:39,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-15 11:10:39,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 11:10:39,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-15 11:10:39,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-15 11:10:39,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-15 11:10:39,193 INFO L87 Difference]: Start difference. First operand 1945 states and 13387 transitions. Second operand 4 states. [2019-02-15 11:10:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:10:50,245 INFO L93 Difference]: Finished difference Result 3175 states and 21705 transitions. [2019-02-15 11:10:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 11:10:50,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-15 11:10:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:10:50,254 INFO L225 Difference]: With dead ends: 3175 [2019-02-15 11:10:50,254 INFO L226 Difference]: Without dead ends: 3170 [2019-02-15 11:10:50,255 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-15 11:10:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-02-15 11:11:02,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3133. [2019-02-15 11:11:02,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-02-15 11:11:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-02-15 11:11:02,536 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-02-15 11:11:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 11:11:02,536 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-02-15 11:11:02,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-15 11:11:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-02-15 11:11:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-15 11:11:02,540 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 11:11:02,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-15 11:11:02,540 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2019-02-15 11:11:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:02,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-02-15 11:11:02,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 11:11:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:02,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:02,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 11:11:02,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 11:11:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:02,580 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-15 11:11:02,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:02,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 11:11:02,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-15 11:11:02,581 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [30], [32], [33] [2019-02-15 11:11:02,582 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 11:11:02,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 11:11:02,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 11:11:02,583 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-15 11:11:02,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 11:11:02,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 11:11:02,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 11:11:02,584 INFO 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-15 11:11:02,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 11:11:02,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 11:11:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 11:11:02,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 11:11:02,600 INFO L478 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-15 11:11:02,603 INFO L478 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-15 11:11:02,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,609 INFO L478 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-15 11:11:02,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,617 INFO L478 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-15 11:11:02,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,628 INFO L478 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-15 11:11:02,640 INFO L478 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-15 11:11:02,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,665 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,713 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,748 INFO L478 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 43 treesize of output 39 [2019-02-15 11:11:02,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,764 INFO L478 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 36 treesize of output 49 [2019-02-15 11:11:02,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-15 11:11:02,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 37 [2019-02-15 11:11:02,844 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,858 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,871 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,887 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,915 INFO L267 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-15 11:11:02,916 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-02-15 11:11:02,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,948 INFO L478 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 51 [2019-02-15 11:11:02,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:02,965 INFO L267 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-15 11:11:02,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-15 11:11:02,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-15 11:11:02,990 INFO L683 Elim1Store]: detected equality via solver [2019-02-15 11:11:02,990 INFO L478 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 59 [2019-02-15 11:11:02,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 11:11:03,010 INFO L267 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-15 11:11:03,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-15 11:11:03,026 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-15 11:11:03,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 11:11:03,047 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-15 11:11:03,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 11:11:03,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 11:11:03,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 11:11:03,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 11:11:03,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 11:11:03,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-15 11:11:03,068 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states. [2019-02-15 11:11:14,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 11:11:14,621 INFO L93 Difference]: Finished difference Result 3149 states and 21664 transitions. [2019-02-15 11:11:14,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 11:11:14,622 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-15 11:11:14,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 11:11:14,630 INFO L225 Difference]: With dead ends: 3149 [2019-02-15 11:11:14,630 INFO L226 Difference]: Without dead ends: 3148 [2019-02-15 11:11:14,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-15 11:11:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states.