java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:13:16,682 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:13:16,685 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:13:16,699 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:13:16,699 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:13:16,700 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:13:16,701 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:13:16,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:13:16,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:13:16,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:13:16,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:13:16,707 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:13:16,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:13:16,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:13:16,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:13:16,711 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:13:16,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:13:16,713 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:13:16,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:13:16,717 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:13:16,718 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:13:16,719 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:13:16,722 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:13:16,722 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:13:16,722 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:13:16,723 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:13:16,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:13:16,727 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:13:16,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:13:16,729 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:13:16,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:13:16,733 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:13:16,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:13:16,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:13:16,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:13:16,737 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:13:16,737 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-01-11 11:13:16,761 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:13:16,762 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:13:16,762 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:13:16,762 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:13:16,763 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:13:16,764 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:13:16,764 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:13:16,764 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:13:16,764 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:13:16,764 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:13:16,765 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:13:16,765 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:13:16,765 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:13:16,765 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:13:16,767 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:13:16,767 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:13:16,767 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:13:16,767 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:13:16,768 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:13:16,770 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:13:16,770 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:13:16,770 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:13:16,770 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:13:16,770 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:13:16,770 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:13:16,771 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:13:16,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:13:16,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:13:16,771 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:13:16,771 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:13:16,772 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:13:16,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:13:16,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:13:16,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:13:16,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:13:16,773 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:13:16,773 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:13:16,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:13:16,773 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:13:16,773 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:13:16,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:13:16,823 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:13:16,826 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:13:16,827 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:13:16,828 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:13:16,828 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-01-11 11:13:16,829 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-01-11 11:13:16,870 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:13:16,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:13:16,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:13:16,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:13:16,874 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:13:16,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,907 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,939 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:13:16,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:13:16,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:13:16,941 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:13:16,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/1) ... [2019-01-11 11:13:16,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:13:16,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:13:16,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:13:16,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:13:16,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:13:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:13:17,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:13:17,331 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:13:17,332 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-11 11:13:17,334 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:13:17 BoogieIcfgContainer [2019-01-11 11:13:17,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:13:17,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:13:17,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:13:17,339 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:13:17,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:13:16" (1/2) ... [2019-01-11 11:13:17,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc6297b and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:13:17, skipping insertion in model container [2019-01-11 11:13:17,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:13:17" (2/2) ... [2019-01-11 11:13:17,342 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-01-11 11:13:17,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:13:17,366 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-11 11:13:17,387 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-11 11:13:17,427 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:13:17,427 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:13:17,428 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:13:17,428 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:13:17,428 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:13:17,428 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:13:17,428 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:13:17,428 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:13:17,463 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 11:13:17,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 11:13:17,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:17,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 11:13:17,477 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:17,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:17,484 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-11 11:13:17,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:17,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:17,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:13:17,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:13:17,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:17,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:13:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:13:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:13:17,700 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-11 11:13:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:17,910 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-11 11:13:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:17,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 11:13:17,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:17,926 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:13:17,926 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:13:17,930 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-01-11 11:13:17,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:13:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-11 11:13:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:13:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-11 11:13:17,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-11 11:13:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:17,966 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-11 11:13:17,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:13:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-11 11:13:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:17,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:17,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:17,968 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:17,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:17,968 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-11 11:13:17,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:17,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:17,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:17,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:18,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:18,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:18,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:18,116 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-11 11:13:18,174 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:18,174 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:18,241 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:18,243 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:18,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:18,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:18,249 INFO 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-01-11 11:13:18,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:18,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:18,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:18,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:18,433 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 11:13:18,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,471 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 31 treesize of output 40 [2019-01-11 11:13:18,685 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 11:13:18,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,714 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 27 treesize of output 42 [2019-01-11 11:13:18,844 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2019-01-11 11:13:18,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:18,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:18,877 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:18,910 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:18,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,078 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 18 treesize of output 21 [2019-01-11 11:13:19,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:19,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:19,106 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 25 treesize of output 51 [2019-01-11 11:13:19,129 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:19,132 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,188 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,203 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,215 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,251 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,285 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-01-11 11:13:19,286 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:19,446 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-11 11:13:19,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:19,493 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-01-11 11:13:19,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,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-01-11 11:13:19,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:19,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:19,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:19,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:19,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:19,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:19,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:19,922 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-11 11:13:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:20,276 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-11 11:13:20,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:20,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:20,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:20,279 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:13:20,279 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 11:13:20,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 11:13:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-11 11:13:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-11 11:13:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-11 11:13:20,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-11 11:13:20,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:20,290 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-11 11:13:20,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-11 11:13:20,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:20,291 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:20,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:20,292 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:20,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-11 11:13:20,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:20,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:20,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:20,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:20,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:20,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:20,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:20,405 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:20,405 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-11 11:13:20,407 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:20,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:20,413 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:20,413 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:20,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:20,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:20,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:20,414 INFO 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-01-11 11:13:20,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:20,423 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:20,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:20,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:13:20,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,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 27 treesize of output 42 [2019-01-11 11:13:20,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:20,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,587 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,655 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 18 treesize of output 21 [2019-01-11 11:13:20,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:20,672 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 23 treesize of output 37 [2019-01-11 11:13:20,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:20,696 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:20,697 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,740 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,767 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,780 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:20,857 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-01-11 11:13:20,857 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:20,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:20,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:20,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:13:21,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:13:21,284 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-01-11 11:13:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:21,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:13:21,395 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:21,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:21,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:21,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:21,397 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-11 11:13:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:21,447 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-11 11:13:21,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:21,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 11:13:21,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:21,450 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:13:21,450 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:13:21,451 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-01-11 11:13:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:13:21,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 11:13:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:13:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-11 11:13:21,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-11 11:13:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:21,456 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-11 11:13:21,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:21,456 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-11 11:13:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:21,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:21,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:21,456 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-11 11:13:21,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:21,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:21,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:13:21,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 11:13:21,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:21,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:13:21,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:13:21,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:13:21,491 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-11 11:13:21,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:21,539 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-11 11:13:21,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:21,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-11 11:13:21,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:21,540 INFO L225 Difference]: With dead ends: 21 [2019-01-11 11:13:21,540 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:13:21,541 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-01-11 11:13:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:13:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-11 11:13:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:13:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-11 11:13:21,545 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-11 11:13:21,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:21,545 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-11 11:13:21,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:13:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-11 11:13:21,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 11:13:21,546 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:21,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 11:13:21,547 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:21,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:21,547 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-11 11:13:21,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:21,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:21,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:21,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:21,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:21,677 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 11:13:21,677 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-11 11:13:21,678 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:21,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:21,683 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:21,684 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 2. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:21,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:21,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:21,684 INFO 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-01-11 11:13:21,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:21,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:21,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:21,730 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 18 treesize of output 21 [2019-01-11 11:13:21,737 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 21 treesize of output 27 [2019-01-11 11:13:21,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,751 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 23 treesize of output 37 [2019-01-11 11:13:21,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,776 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 25 treesize of output 51 [2019-01-11 11:13:21,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:21,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:21,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,939 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 31 treesize of output 40 [2019-01-11 11:13:21,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:21,988 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 27 treesize of output 42 [2019-01-11 11:13:22,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:22,032 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,041 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,050 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,073 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-01-11 11:13:22,073 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:22,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,134 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-01-11 11:13:22,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,164 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-01-11 11:13:22,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:22,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:22,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:22,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:22,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:22,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:22,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:22,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:22,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:22,217 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-11 11:13:22,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:22,392 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-11 11:13:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:22,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 11:13:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:22,395 INFO L225 Difference]: With dead ends: 39 [2019-01-11 11:13:22,395 INFO L226 Difference]: Without dead ends: 38 [2019-01-11 11:13:22,395 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-01-11 11:13:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-11 11:13:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-11 11:13:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 11:13:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-11 11:13:22,401 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-11 11:13:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:22,401 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-11 11:13:22,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-11 11:13:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:22,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:22,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:22,403 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-11 11:13:22,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:22,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:22,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:22,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:22,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:22,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:22,494 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:22,494 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-11 11:13:22,497 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:22,497 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:22,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:22,503 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:22,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:22,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:22,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:22,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 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-01-11 11:13:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:22,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:22,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:22,568 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 18 treesize of output 21 [2019-01-11 11:13:22,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 21 treesize of output 27 [2019-01-11 11:13:22,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,640 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 23 treesize of output 37 [2019-01-11 11:13:22,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,648 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 25 treesize of output 51 [2019-01-11 11:13:22,674 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:22,674 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,728 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:22,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,827 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 31 treesize of output 40 [2019-01-11 11:13:22,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:22,932 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 27 treesize of output 42 [2019-01-11 11:13:23,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:23,030 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,041 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,051 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,071 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-01-11 11:13:23,071 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:23,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-11 11:13:23,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:13:23,192 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-01-11 11:13:23,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-01-11 11:13:23,553 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-11 11:13:23,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,664 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 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 11:13:23,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:13:23,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:23,883 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:23,885 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 45 treesize of output 51 [2019-01-11 11:13:23,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:23,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:13:23,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-01-11 11:13:24,219 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-01-11 11:13:24,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-01-11 11:13:24,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:24,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:24,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:24,270 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:24,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:24,271 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-11 11:13:24,605 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-01-11 11:13:24,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:24,875 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-01-11 11:13:24,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:24,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:24,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:24,877 INFO L225 Difference]: With dead ends: 59 [2019-01-11 11:13:24,878 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:24,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:24,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-01-11 11:13:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-11 11:13:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-01-11 11:13:24,887 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-01-11 11:13:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:24,887 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-01-11 11:13:24,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-01-11 11:13:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:24,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:24,888 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:24,888 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:24,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-11 11:13:24,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:24,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:24,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:24,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:24,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:24,942 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:24,943 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-11 11:13:24,946 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:24,946 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:24,954 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:24,955 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:24,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:24,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:24,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:24,955 INFO 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-01-11 11:13:24,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:24,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:24,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:25,013 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 21 treesize of output 23 [2019-01-11 11:13:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:13:25,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,030 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 25 treesize of output 47 [2019-01-11 11:13:25,049 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:13:25,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,148 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 26 treesize of output 25 [2019-01-11 11:13:25,268 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-11 11:13:25,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,357 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 22 treesize of output 38 [2019-01-11 11:13:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:13:25,422 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,430 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,439 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,459 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-01-11 11:13:25,460 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:13:25,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,487 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-11 11:13:25,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,502 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-01-11 11:13:25,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-01-11 11:13:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:25,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:25,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-11 11:13:25,552 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:25,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:25,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:25,553 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-01-11 11:13:25,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:25,686 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-01-11 11:13:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:25,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:13:25,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:25,688 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:13:25,688 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 11:13:25,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 11:13:25,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-11 11:13:25,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 11:13:25,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-01-11 11:13:25,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-01-11 11:13:25,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:25,707 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-01-11 11:13:25,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:25,707 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-01-11 11:13:25,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:25,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:25,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:25,708 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:25,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:25,708 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-11 11:13:25,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:25,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:25,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:25,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:25,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:25,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:25,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:25,848 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:25,848 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-11 11:13:25,850 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:25,850 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:25,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:25,855 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:25,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:25,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:25,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:25,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:25,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:25,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:25,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:25,912 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 18 treesize of output 21 [2019-01-11 11:13:25,915 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 21 treesize of output 27 [2019-01-11 11:13:25,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,923 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 23 treesize of output 37 [2019-01-11 11:13:25,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:25,931 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 25 treesize of output 51 [2019-01-11 11:13:25,941 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:25,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,980 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:25,993 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,028 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 31 treesize of output 40 [2019-01-11 11:13:26,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,059 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 27 treesize of output 42 [2019-01-11 11:13:26,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:26,111 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,122 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,157 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-01-11 11:13:26,158 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:26,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,238 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-01-11 11:13:26,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,263 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-01-11 11:13:26,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:26,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:26,316 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 11:13:26,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:26,357 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-01-11 11:13:26,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-01-11 11:13:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:26,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:26,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:26,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:26,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:26,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:26,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:26,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:26,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:26,424 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-01-11 11:13:26,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:26,864 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-01-11 11:13:26,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:26,864 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:26,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:26,866 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:13:26,866 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:26,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-01-11 11:13:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:13:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-01-11 11:13:26,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-01-11 11:13:26,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:26,875 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-01-11 11:13:26,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:26,875 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-01-11 11:13:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:26,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:26,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:26,876 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-01-11 11:13:26,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:26,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:26,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:26,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:26,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:26,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:26,977 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-01-11 11:13:26,978 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:26,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:26,984 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:26,984 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:26,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:26,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:26,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:26,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:26,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:26,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:27,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:27,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,035 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 31 treesize of output 40 [2019-01-11 11:13:27,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,063 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 27 treesize of output 42 [2019-01-11 11:13:27,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:27,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,108 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,134 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 18 treesize of output 21 [2019-01-11 11:13:27,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:27,141 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 23 treesize of output 37 [2019-01-11 11:13:27,146 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 25 treesize of output 51 [2019-01-11 11:13:27,157 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:27,158 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,179 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,195 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,218 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,240 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-01-11 11:13:27,240 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,322 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-01-11 11:13:27,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,355 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-01-11 11:13:27,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:27,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,405 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-01-11 11:13:27,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:27,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-01-11 11:13:27,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 11:13:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:27,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:27,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:27,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:27,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:27,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:27,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:27,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:27,487 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-01-11 11:13:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:27,819 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-01-11 11:13:27,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:27,819 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:27,821 INFO L225 Difference]: With dead ends: 52 [2019-01-11 11:13:27,821 INFO L226 Difference]: Without dead ends: 48 [2019-01-11 11:13:27,821 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-01-11 11:13:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-11 11:13:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-01-11 11:13:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:13:27,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-11 11:13:27,829 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-11 11:13:27,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:27,830 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-11 11:13:27,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:27,830 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-11 11:13:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:27,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:27,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:27,831 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:27,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-11 11:13:27,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:27,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:27,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:27,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:27,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:27,868 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:27,868 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-11 11:13:27,869 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:27,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:27,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:27,875 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:27,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:27,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:27,875 INFO 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-01-11 11:13:27,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:27,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:27,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:27,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 18 treesize of output 21 [2019-01-11 11:13:27,929 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 21 treesize of output 23 [2019-01-11 11:13:27,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,936 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 23 treesize of output 33 [2019-01-11 11:13:27,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:27,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:13:28,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,033 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 27 treesize of output 62 [2019-01-11 11:13:28,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,093 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,123 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-01-11 11:13:28,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,140 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-01-11 11:13:28,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,174 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-01-11 11:13:28,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,223 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-01-11 11:13:28,224 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,236 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,251 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,296 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-01-11 11:13:28,297 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:13:28,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,322 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-01-11 11:13:28,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,347 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-01-11 11:13:28,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:13:28,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:28,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:28,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:28,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:28,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:28,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:28,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:28,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:28,396 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-01-11 11:13:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:28,554 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-01-11 11:13:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:28,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:13:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:28,555 INFO L225 Difference]: With dead ends: 42 [2019-01-11 11:13:28,556 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 11:13:28,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-01-11 11:13:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 11:13:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-01-11 11:13:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-11 11:13:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-01-11 11:13:28,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-01-11 11:13:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:28,563 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-01-11 11:13:28,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-01-11 11:13:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:28,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:28,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:28,564 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-11 11:13:28,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:28,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:28,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:28,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:28,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:28,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:28,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:28,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:28,638 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:28,638 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-11 11:13:28,639 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:28,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:28,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:28,644 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:28,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:28,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:28,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:28,645 INFO 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-01-11 11:13:28,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:28,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:28,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:28,697 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 18 treesize of output 21 [2019-01-11 11:13:28,700 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 21 treesize of output 27 [2019-01-11 11:13:28,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,708 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 23 treesize of output 37 [2019-01-11 11:13:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:28,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,735 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:28,736 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,827 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-01-11 11:13:28,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,863 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-01-11 11:13:28,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,901 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-01-11 11:13:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:28,948 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-01-11 11:13:28,949 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,964 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,980 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:28,995 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:29,025 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-01-11 11:13:29,025 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:13:29,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,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, 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-01-11 11:13:29,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:29,084 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-01-11 11:13:29,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:29,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,121 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-01-11 11:13:29,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:29,155 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-01-11 11:13:29,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:13:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:29,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:29,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:29,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:29,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:29,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:29,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:29,217 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-01-11 11:13:29,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:29,629 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-01-11 11:13:29,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:29,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:29,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:29,636 INFO L225 Difference]: With dead ends: 54 [2019-01-11 11:13:29,636 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 11:13:29,637 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-01-11 11:13:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 11:13:29,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-01-11 11:13:29,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 11:13:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-01-11 11:13:29,653 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-01-11 11:13:29,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:29,654 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-01-11 11:13:29,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:29,654 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-01-11 11:13:29,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:29,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:29,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:29,655 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:29,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:29,655 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-01-11 11:13:29,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:29,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:29,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:29,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:29,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:29,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:29,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:29,802 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:29,802 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-11 11:13:29,803 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:29,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:29,808 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:29,808 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:29,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:29,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:29,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:29,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:29,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:29,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:29,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:29,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,856 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 31 treesize of output 40 [2019-01-11 11:13:29,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,907 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 27 treesize of output 42 [2019-01-11 11:13:29,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:29,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:29,942 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:29,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:29,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:29,975 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 18 treesize of output 21 [2019-01-11 11:13:29,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:29,981 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 23 treesize of output 37 [2019-01-11 11:13:29,985 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 25 treesize of output 51 [2019-01-11 11:13:29,996 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:29,997 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,027 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,039 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,049 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,071 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-01-11 11:13:30,072 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:30,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,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, 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-01-11 11:13:30,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,122 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-01-11 11:13:30,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:30,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,181 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-01-11 11:13:30,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,205 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-01-11 11:13:30,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 11:13:30,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:30,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:30,257 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:30,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:30,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:30,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:30,257 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-01-11 11:13:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:30,534 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-01-11 11:13:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:30,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:30,535 INFO L225 Difference]: With dead ends: 63 [2019-01-11 11:13:30,536 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 11:13:30,536 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-01-11 11:13:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 11:13:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-01-11 11:13:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:13:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-01-11 11:13:30,546 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-01-11 11:13:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:30,546 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-01-11 11:13:30,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:30,547 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-01-11 11:13:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:30,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:30,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:30,548 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-11 11:13:30,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:30,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:30,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:30,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:13:30,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:13:30,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:30,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:30,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:30,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:13:30,588 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-01-11 11:13:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:30,694 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-01-11 11:13:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:30,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 11:13:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:30,696 INFO L225 Difference]: With dead ends: 41 [2019-01-11 11:13:30,696 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:13:30,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:13:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:13:30,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-01-11 11:13:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:13:30,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-01-11 11:13:30,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-01-11 11:13:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:30,708 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-01-11 11:13:30,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:30,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-01-11 11:13:30,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:30,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:30,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:30,709 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:30,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:30,709 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-01-11 11:13:30,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:30,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:30,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:30,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:30,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:30,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:30,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:30,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:30,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:30,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:30,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:30,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:30,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:30,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:13:30,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:30,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:30,803 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 18 treesize of output 21 [2019-01-11 11:13:30,806 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 21 treesize of output 27 [2019-01-11 11:13:30,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,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 23 treesize of output 37 [2019-01-11 11:13:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,825 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 25 treesize of output 51 [2019-01-11 11:13:30,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,836 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:30,836 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,894 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:30,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,932 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-01-11 11:13:30,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:30,965 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-01-11 11:13:31,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,054 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-01-11 11:13:31,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,108 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-01-11 11:13:31,109 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,124 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,141 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,157 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,188 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-01-11 11:13:31,189 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:13:31,428 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-11 11:13:31,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,470 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-01-11 11:13:31,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,723 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-01-11 11:13:31,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:31,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:31,753 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:31,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, 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 79 [2019-01-11 11:13:31,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:31,784 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-01-11 11:13:31,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-01-11 11:13:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:31,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:31,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:31,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:31,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:31,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:31,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:31,850 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-01-11 11:13:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:32,281 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-01-11 11:13:32,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:32,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:32,283 INFO L225 Difference]: With dead ends: 57 [2019-01-11 11:13:32,283 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:13:32,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:32,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:13:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-01-11 11:13:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 11:13:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-01-11 11:13:32,293 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-01-11 11:13:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:32,293 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-01-11 11:13:32,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:32,294 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-01-11 11:13:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:32,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:32,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:32,295 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:32,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:32,295 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-11 11:13:32,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:32,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:32,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:32,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:32,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:32,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:32,378 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-11 11:13:32,379 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:32,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:32,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:32,383 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:32,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:32,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:32,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:32,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:32,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:32,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:32,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:32,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:13:32,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,454 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 27 treesize of output 42 [2019-01-11 11:13:32,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:32,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,533 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 18 treesize of output 21 [2019-01-11 11:13:32,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:32,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:32,571 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 25 treesize of output 51 [2019-01-11 11:13:32,615 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:32,615 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,636 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,650 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,661 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,691 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-01-11 11:13:32,691 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:32,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,718 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-01-11 11:13:32,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,771 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-01-11 11:13:32,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:32,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:32,792 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-01-11 11:13:32,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:32,813 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-01-11 11:13:32,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 11:13:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:32,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:32,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:32,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:32,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:32,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:32,872 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-01-11 11:13:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:33,166 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-01-11 11:13:33,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:33,166 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:33,167 INFO L225 Difference]: With dead ends: 61 [2019-01-11 11:13:33,168 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 11:13:33,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:33,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 11:13:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-01-11 11:13:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-11 11:13:33,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-01-11 11:13:33,179 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-01-11 11:13:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:33,179 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-01-11 11:13:33,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-01-11 11:13:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:33,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:33,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:33,181 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-11 11:13:33,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:33,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:33,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:33,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:33,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:33,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:33,262 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-11 11:13:33,264 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:33,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:33,268 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:33,268 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:33,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:33,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:33,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:33,269 INFO 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-01-11 11:13:33,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:33,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:33,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:33,291 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 18 treesize of output 21 [2019-01-11 11:13:33,318 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 21 treesize of output 23 [2019-01-11 11:13:33,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,327 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 23 treesize of output 33 [2019-01-11 11:13:33,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,335 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 25 treesize of output 47 [2019-01-11 11:13:33,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,345 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 27 treesize of output 62 [2019-01-11 11:13:33,346 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,377 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,390 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,400 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,430 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-01-11 11:13:33,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,446 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-01-11 11:13:33,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,483 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-01-11 11:13:33,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,531 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-01-11 11:13:33,532 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,545 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,559 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,575 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,657 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-01-11 11:13:33,658 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:13:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:33,709 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-01-11 11:13:33,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:33,737 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-01-11 11:13:33,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:13:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:33,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:33,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:33,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 11:13:33,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:33,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 11:13:33,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 11:13:33,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:13:33,786 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-01-11 11:13:34,301 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-01-11 11:13:34,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:34,568 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-01-11 11:13:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:13:34,569 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 11:13:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:34,570 INFO L225 Difference]: With dead ends: 53 [2019-01-11 11:13:34,570 INFO L226 Difference]: Without dead ends: 52 [2019-01-11 11:13:34,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:13:34,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-11 11:13:34,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-01-11 11:13:34,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:13:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-01-11 11:13:34,582 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-01-11 11:13:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:34,582 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-01-11 11:13:34,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 11:13:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-01-11 11:13:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 11:13:34,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:34,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 11:13:34,583 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:34,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-11 11:13:34,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:34,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:34,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:34,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:34,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:34,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:34,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:34,711 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 11:13:34,712 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-11 11:13:34,713 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:34,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:34,717 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:34,717 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 56 root evaluator evaluations with a maximum evaluation depth of 2. Performed 56 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:34,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:34,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:34,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:34,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:34,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:34,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:34,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,768 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 23 treesize of output 37 [2019-01-11 11:13:34,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:34,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:34,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,835 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:34,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,912 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-01-11 11:13:34,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,944 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-01-11 11:13:34,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:34,980 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-01-11 11:13:35,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,028 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-01-11 11:13:35,029 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,043 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,059 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,074 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,144 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-01-11 11:13:35,144 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:13:35,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,167 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-01-11 11:13:35,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,196 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-01-11 11:13:35,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:35,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:35,242 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-01-11 11:13:35,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:35,275 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-01-11 11:13:35,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 11:13:35,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-01-11 11:13:35,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:35,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:35,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:35,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:35,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:35,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:35,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:35,353 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-01-11 11:13:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:35,862 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-01-11 11:13:35,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:35,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 11:13:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:35,864 INFO L225 Difference]: With dead ends: 69 [2019-01-11 11:13:35,864 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:13:35,865 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-01-11 11:13:35,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:13:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-01-11 11:13:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:13:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-01-11 11:13:35,875 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-01-11 11:13:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:35,875 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-01-11 11:13:35,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-01-11 11:13:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:35,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:35,876 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 11:13:35,876 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:35,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,876 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-01-11 11:13:35,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:35,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:35,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:35,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:35,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:35,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:35,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:35,972 INFO 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-01-11 11:13:35,981 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:35,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:35,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:13:35,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:35,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:36,022 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 18 treesize of output 21 [2019-01-11 11:13:36,033 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 21 treesize of output 27 [2019-01-11 11:13:36,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,040 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 23 treesize of output 37 [2019-01-11 11:13:36,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,079 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 25 treesize of output 51 [2019-01-11 11:13:36,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,101 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:36,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,264 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,289 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,325 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-01-11 11:13:36,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,354 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-01-11 11:13:36,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,393 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-01-11 11:13:36,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,441 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-01-11 11:13:36,441 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,456 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,471 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,486 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,516 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-01-11 11:13:36,517 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-01-11 11:13:36,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,552 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-01-11 11:13:36,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,580 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-01-11 11:13:36,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:36,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,612 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 78 [2019-01-11 11:13:36,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,645 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-01-11 11:13:36,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-01-11 11:13:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:36,689 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-01-11 11:13:36,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:36,719 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-01-11 11:13:36,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 11:13:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:36,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:36,755 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:36,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:36,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 11:13:36,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:36,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:13:36,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:13:36,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:36,776 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-01-11 11:13:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:37,082 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-01-11 11:13:37,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:37,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 11:13:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:37,086 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:13:37,086 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:13:37,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:13:37,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-01-11 11:13:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 11:13:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-01-11 11:13:37,100 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-01-11 11:13:37,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:37,100 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-01-11 11:13:37,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:13:37,101 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-01-11 11:13:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:37,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:37,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:37,102 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:37,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:37,102 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-11 11:13:37,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:37,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:37,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13: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-01-11 11:13:37,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:37,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:37,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:37,209 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-11 11:13:37,210 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:37,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:37,213 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:37,214 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:37,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:37,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:37,214 INFO 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-01-11 11:13:37,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:37,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:37,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:37,260 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 18 treesize of output 21 [2019-01-11 11:13:37,282 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 21 treesize of output 23 [2019-01-11 11:13:37,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,289 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 23 treesize of output 33 [2019-01-11 11:13:37,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,296 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 25 treesize of output 47 [2019-01-11 11:13:37,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,306 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 27 treesize of output 62 [2019-01-11 11:13:37,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,330 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,353 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,384 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-01-11 11:13:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,400 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-01-11 11:13:37,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,496 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-01-11 11:13:37,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,540 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-01-11 11:13:37,541 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,554 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,568 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,583 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,610 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-01-11 11:13:37,610 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:13:37,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,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, 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-01-11 11:13:37,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,685 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-01-11 11:13:37,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:13:37,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:37,793 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 76 [2019-01-11 11:13:37,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:37,821 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-01-11 11:13:37,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-01-11 11:13:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:37,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:37,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:37,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:37,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:37,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:37,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:37,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:37,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:37,881 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-01-11 11:13:38,301 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-11 11:13:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:38,499 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-01-11 11:13:38,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:38,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:38,501 INFO L225 Difference]: With dead ends: 84 [2019-01-11 11:13:38,501 INFO L226 Difference]: Without dead ends: 78 [2019-01-11 11:13:38,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-11 11:13:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-01-11 11:13:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:13:38,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-01-11 11:13:38,518 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-01-11 11:13:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:38,518 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-01-11 11:13:38,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-01-11 11:13:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:38,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:38,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:38,520 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-11 11:13:38,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:38,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:38,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:38,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:38,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:38,606 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-11 11:13:38,609 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:38,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:38,613 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:38,613 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:38,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:38,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:38,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:38,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:38,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:38,652 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 18 treesize of output 21 [2019-01-11 11:13:38,655 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 21 treesize of output 27 [2019-01-11 11:13:38,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:13:38,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,675 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 25 treesize of output 51 [2019-01-11 11:13:38,762 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:38,762 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,809 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,843 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 31 treesize of output 40 [2019-01-11 11:13:38,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,872 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 27 treesize of output 42 [2019-01-11 11:13:38,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:38,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:38,909 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,926 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:38,969 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-01-11 11:13:38,969 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:39,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-01-11 11:13:39,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:13:39,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:13:39,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-01-11 11:13:39,578 WARN L181 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-11 11:13:39,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:39,873 INFO L303 Elim1Store]: Index analysis took 289 ms [2019-01-11 11:13:40,225 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 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 11:13:40,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:13:40,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:40,761 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:40,762 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 45 treesize of output 51 [2019-01-11 11:13:40,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:40,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 11:13:40,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-01-11 11:13:41,126 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-01-11 11:13:41,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,141 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:41,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, 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 86 [2019-01-11 11:13:41,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,253 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 55 treesize of output 53 [2019-01-11 11:13:41,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,332 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:41,333 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 82 [2019-01-11 11:13:41,334 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:41,439 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:41,439 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-01-11 11:13:41,440 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:41,506 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-01-11 11:13:41,506 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-01-11 11:13:41,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:41,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:41,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:41,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:13:41,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:41,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:41,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:41,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:41,700 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-01-11 11:13:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:42,508 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-01-11 11:13:42,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:13:42,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:42,510 INFO L225 Difference]: With dead ends: 109 [2019-01-11 11:13:42,510 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 11:13:42,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:13:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 11:13:42,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-01-11 11:13:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 11:13:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-01-11 11:13:42,525 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-01-11 11:13:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:42,526 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-01-11 11:13:42,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-01-11 11:13:42,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:42,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:42,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:42,527 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:42,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:42,527 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-11 11:13:42,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:42,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:42,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:42,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:42,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:42,839 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-11 11:13:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:42,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:42,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:42,912 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:42,912 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-11 11:13:42,913 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:42,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:42,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:42,918 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:42,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:42,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:42,919 INFO 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-01-11 11:13:42,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:42,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:42,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:42,950 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 18 treesize of output 21 [2019-01-11 11:13:42,951 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 21 treesize of output 27 [2019-01-11 11:13:42,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,956 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 23 treesize of output 37 [2019-01-11 11:13:42,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:42,964 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 25 treesize of output 51 [2019-01-11 11:13:42,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:42,973 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:42,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,003 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,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 31 treesize of output 40 [2019-01-11 11:13:43,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,072 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 27 treesize of output 42 [2019-01-11 11:13:43,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:43,101 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,111 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,120 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,203 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-01-11 11:13:43,204 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:43,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,242 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-01-11 11:13:43,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,258 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-01-11 11:13:43,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:43,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,282 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 59 [2019-01-11 11:13:43,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:43,302 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-01-11 11:13:43,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-01-11 11:13:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:43,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:43,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:43,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:43,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:43,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:43,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:43,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:43,362 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-01-11 11:13:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:43,705 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-01-11 11:13:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:43,705 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:43,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:43,707 INFO L225 Difference]: With dead ends: 77 [2019-01-11 11:13:43,707 INFO L226 Difference]: Without dead ends: 76 [2019-01-11 11:13:43,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-11 11:13:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-01-11 11:13:43,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 11:13:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-01-11 11:13:43,728 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-01-11 11:13:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:43,729 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-01-11 11:13:43,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-01-11 11:13:43,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:43,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:43,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:43,730 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:43,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:43,730 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-01-11 11:13:43,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:43,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:43,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:43,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:43,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:43,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:43,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:43,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:43,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:43,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:43,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:43,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:13:43,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:43,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:43,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,919 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-01-11 11:13:43,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,952 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-01-11 11:13:43,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:43,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 11:13:44,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,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, 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-01-11 11:13:44,040 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,070 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,108 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 18 treesize of output 21 [2019-01-11 11:13:44,111 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 21 treesize of output 27 [2019-01-11 11:13:44,113 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 23 treesize of output 37 [2019-01-11 11:13:44,116 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 25 treesize of output 51 [2019-01-11 11:13:44,118 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:44,119 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,142 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,156 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,167 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,177 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,205 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-01-11 11:13:44,206 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:13:44,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,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, 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-01-11 11:13:44,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,265 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-01-11 11:13:44,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:44,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,296 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:44,297 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-01-11 11:13:44,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,327 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-01-11 11:13:44,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-11 11:13:44,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:44,362 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 82 [2019-01-11 11:13:44,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:44,401 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-01-11 11:13:44,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:13:44,421 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:44,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:13:44,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:44,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:44,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:44,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:44,504 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-01-11 11:13:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:45,032 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-01-11 11:13:45,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:45,035 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:45,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:45,036 INFO L225 Difference]: With dead ends: 88 [2019-01-11 11:13:45,036 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:13:45,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:13:45,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:13:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-01-11 11:13:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:13:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-11 11:13:45,055 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-11 11:13:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:45,056 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-11 11:13:45,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:45,056 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-11 11:13:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:45,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:45,056 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:45,057 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-11 11:13:45,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:45,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:45,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:45,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:45,194 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 11:13:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:45,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:45,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:45,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:45,368 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-11 11:13:45,369 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:45,369 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:45,372 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:45,372 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:45,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:45,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:45,373 INFO 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-01-11 11:13:45,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:45,388 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:45,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:45,405 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 18 treesize of output 21 [2019-01-11 11:13:45,417 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 21 treesize of output 23 [2019-01-11 11:13:45,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,421 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 23 treesize of output 33 [2019-01-11 11:13:45,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,429 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 25 treesize of output 47 [2019-01-11 11:13:45,439 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:13:45,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,501 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 26 treesize of output 25 [2019-01-11 11:13:45,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:13:45,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:13:45,544 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,552 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,560 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,578 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-01-11 11:13:45,578 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:13:45,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,632 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:13:45,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,641 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-01-11 11:13:45,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:13:45,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:45,661 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 50 [2019-01-11 11:13:45,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:45,784 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-01-11 11:13:45,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-11 11:13:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:45,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:45,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:45,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:45,838 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:45,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:45,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:45,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:45,838 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-01-11 11:13:46,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:46,092 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-01-11 11:13:46,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:46,093 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:46,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:46,094 INFO L225 Difference]: With dead ends: 81 [2019-01-11 11:13:46,094 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 11:13:46,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 11:13:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-01-11 11:13:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 11:13:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-01-11 11:13:46,108 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-01-11 11:13:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:46,109 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-01-11 11:13:46,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-01-11 11:13:46,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:46,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:46,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:46,110 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:46,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:46,110 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-11 11:13:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:46,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:46,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:46,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:46,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:46,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:46,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:46,281 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:46,281 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-11 11:13:46,282 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:46,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:46,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:46,286 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:46,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:46,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:46,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:46,286 INFO 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-01-11 11:13:46,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:46,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:46,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:46,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:13:46,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,351 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 27 treesize of output 42 [2019-01-11 11:13:46,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:46,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,420 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 18 treesize of output 21 [2019-01-11 11:13:46,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:46,426 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 23 treesize of output 37 [2019-01-11 11:13:46,428 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 25 treesize of output 51 [2019-01-11 11:13:46,432 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:46,433 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,450 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,463 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,503 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-01-11 11:13:46,504 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:46,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,547 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-01-11 11:13:46,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,564 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-01-11 11:13:46,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,597 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-01-11 11:13:46,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,619 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-01-11 11:13:46,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:13:46,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,647 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:46,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:46,649 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 76 [2019-01-11 11:13:46,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:46,672 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-01-11 11:13:46,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:13:46,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:46,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:46,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:46,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:46,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:13:46,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:46,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:46,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:46,772 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-01-11 11:13:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:47,248 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-01-11 11:13:47,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:13:47,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:47,256 INFO L225 Difference]: With dead ends: 113 [2019-01-11 11:13:47,256 INFO L226 Difference]: Without dead ends: 112 [2019-01-11 11:13:47,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-11 11:13:47,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-01-11 11:13:47,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-11 11:13:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-01-11 11:13:47,276 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-01-11 11:13:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:47,276 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-01-11 11:13:47,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:47,277 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-01-11 11:13:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:47,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:47,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:47,277 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:47,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-01-11 11:13:47,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:47,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:47,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:47,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:47,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:47,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:47,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:47,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:47,366 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-01-11 11:13:47,370 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:47,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:47,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:47,377 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:13:47,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:47,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:47,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:47,378 INFO 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-01-11 11:13:47,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:47,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:47,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:13:47,418 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 21 treesize of output 27 [2019-01-11 11:13:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,427 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 23 treesize of output 37 [2019-01-11 11:13:47,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,473 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 25 treesize of output 51 [2019-01-11 11:13:47,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:47,509 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-01-11 11:13:47,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:13:47,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:47,648 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,657 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,666 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:47,686 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-01-11 11:13:47,687 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:47,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:47,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:47,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:13:47,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 11:13:47,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-01-11 11:13:48,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,015 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 55 treesize of output 69 [2019-01-11 11:13:48,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,096 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:48,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, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-01-11 11:13:48,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,158 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 65 [2019-01-11 11:13:48,158 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,217 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-01-11 11:13:48,217 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:96 [2019-01-11 11:13:48,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-11 11:13:48,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,426 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:48,427 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 77 [2019-01-11 11:13:48,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:48,496 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 55 treesize of output 51 [2019-01-11 11:13:48,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:48,540 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-01-11 11:13:48,541 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-01-11 11:13:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:48,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:48,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:48,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 11:13:48,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:48,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:48,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:48,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:48,627 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-01-11 11:13:49,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:49,451 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-01-11 11:13:49,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:13:49,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:49,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:49,453 INFO L225 Difference]: With dead ends: 137 [2019-01-11 11:13:49,453 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 11:13:49,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:13:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 11:13:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-01-11 11:13:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 11:13:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-01-11 11:13:49,484 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-01-11 11:13:49,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:49,485 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-01-11 11:13:49,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:49,485 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-01-11 11:13:49,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:49,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:49,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:49,486 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:49,486 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-11 11:13:49,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:49,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:49,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:49,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:49,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:49,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:49,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:49,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:49,581 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:49,581 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-11 11:13:49,582 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:49,582 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:49,584 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:49,585 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:49,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:49,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:49,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:49,585 INFO 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-01-11 11:13:49,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:49,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:49,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:49,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,622 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-01-11 11:13:49,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,655 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-01-11 11:13:49,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,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, 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-01-11 11:13:49,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,739 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-01-11 11:13:49,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,768 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,808 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 18 treesize of output 21 [2019-01-11 11:13:49,811 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 21 treesize of output 27 [2019-01-11 11:13:49,813 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 23 treesize of output 37 [2019-01-11 11:13:49,820 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 25 treesize of output 51 [2019-01-11 11:13:49,822 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:13:49,823 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,845 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,858 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,869 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,879 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,909 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-01-11 11:13:49,909 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:13:49,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:49,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 36 treesize of output 72 [2019-01-11 11:13:49,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:49,979 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-01-11 11:13:49,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:13:50,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,021 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:50,022 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-01-11 11:13:50,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,067 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-01-11 11:13:50,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 11:13:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:50,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:50,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:50,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:50,201 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:50,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:50,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:50,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:50,202 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-01-11 11:13:50,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:50,606 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-01-11 11:13:50,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:50,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:50,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:50,608 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:13:50,609 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 11:13:50,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 11:13:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-01-11 11:13:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-11 11:13:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-01-11 11:13:50,649 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-01-11 11:13:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:50,649 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-01-11 11:13:50,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-01-11 11:13:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:50,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:50,650 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:50,651 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-11 11:13:50,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:50,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:50,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:50,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:50,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:50,706 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:50,707 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-11 11:13:50,707 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:50,708 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:50,712 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:50,712 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:50,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:50,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:50,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:50,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:50,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:50,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:50,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:50,735 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 18 treesize of output 21 [2019-01-11 11:13:50,739 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 21 treesize of output 23 [2019-01-11 11:13:50,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,753 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 23 treesize of output 33 [2019-01-11 11:13:50,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,761 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 25 treesize of output 47 [2019-01-11 11:13:50,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,769 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 27 treesize of output 62 [2019-01-11 11:13:50,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,817 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,848 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-01-11 11:13:50,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,865 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-01-11 11:13:50,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,905 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-01-11 11:13:50,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:50,951 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-01-11 11:13:50,952 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,965 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,978 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:50,993 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,021 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-01-11 11:13:51,021 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:13:51,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:51,038 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-01-11 11:13:51,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:51,063 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-01-11 11:13:51,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 11:13:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:51,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:51,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:51,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:13:51,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:13:51,188 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:51,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:51,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:51,189 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-01-11 11:13:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:51,313 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-01-11 11:13:51,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:51,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:13:51,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:51,315 INFO L225 Difference]: With dead ends: 105 [2019-01-11 11:13:51,315 INFO L226 Difference]: Without dead ends: 104 [2019-01-11 11:13:51,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:13:51,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-11 11:13:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-01-11 11:13:51,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 11:13:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-01-11 11:13:51,361 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-01-11 11:13:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:51,361 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-01-11 11:13:51,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:51,362 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-01-11 11:13:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:51,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:51,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:51,363 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:51,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:51,363 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-01-11 11:13:51,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:51,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:51,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:51,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:51,921 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-01-11 11:13:52,364 WARN L181 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2019-01-11 11:13:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:52,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:52,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:52,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:52,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,728 INFO 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-01-11 11:13:52,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:13:52,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:13:52,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:13:52,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:52,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:52,807 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 18 treesize of output 21 [2019-01-11 11:13:52,810 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 21 treesize of output 27 [2019-01-11 11:13:52,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,816 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 23 treesize of output 37 [2019-01-11 11:13:52,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:13:52,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:52,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,849 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,864 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:52,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:52,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 31 treesize of output 40 [2019-01-11 11:13:53,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:13:53,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:53,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,049 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,058 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,079 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-01-11 11:13:53,079 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:53,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:13:53,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:13:53,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-11 11:13:53,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:231 [2019-01-11 11:13:53,466 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-01-11 11:13:53,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2019-01-11 11:13:53,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,574 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:53,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 51 [2019-01-11 11:13:53,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,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, 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 65 [2019-01-11 11:13:53,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-01-11 11:13:53,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,813 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-01-11 11:13:53,814 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:197, output treesize:121 [2019-01-11 11:13:53,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,886 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:53,886 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 82 [2019-01-11 11:13:53,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:53,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:53,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:53,991 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 76 [2019-01-11 11:13:53,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,088 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 55 treesize of output 53 [2019-01-11 11:13:54,089 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:54,161 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:54,162 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 67 [2019-01-11 11:13:54,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:54,221 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-01-11 11:13:54,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-01-11 11:13:54,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:54,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:54,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:54,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:13:54,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:54,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:13:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:13:54,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:13:54,360 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-01-11 11:13:54,740 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-01-11 11:13:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:55,079 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-01-11 11:13:55,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:55,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 11:13:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:55,081 INFO L225 Difference]: With dead ends: 131 [2019-01-11 11:13:55,081 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 11:13:55,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:13:55,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 11:13:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-01-11 11:13:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 11:13:55,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-01-11 11:13:55,102 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-01-11 11:13:55,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:55,102 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-01-11 11:13:55,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:13:55,102 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-01-11 11:13:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:55,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:55,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:55,102 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:55,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:55,103 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-11 11:13:55,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:55,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:55,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:55,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:55,264 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-01-11 11:13:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:55,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:55,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:55,299 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:55,299 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-11 11:13:55,300 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:55,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:55,303 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:55,303 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:55,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:55,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:55,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:55,304 INFO 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-01-11 11:13:55,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:55,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:55,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:55,321 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 18 treesize of output 21 [2019-01-11 11:13:55,327 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 21 treesize of output 23 [2019-01-11 11:13:55,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,335 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 23 treesize of output 33 [2019-01-11 11:13:55,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,345 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 25 treesize of output 47 [2019-01-11 11:13:55,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,363 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 27 treesize of output 62 [2019-01-11 11:13:55,364 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,418 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,464 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-01-11 11:13:55,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,485 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-01-11 11:13:55,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,533 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-01-11 11:13:55,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,592 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-01-11 11:13:55,593 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,607 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,636 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,663 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-01-11 11:13:55,664 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:13:55,850 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-11 11:13:55,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,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, 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-01-11 11:13:55,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,882 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-01-11 11:13:55,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:13:55,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:55,929 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:55,930 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 76 [2019-01-11 11:13:55,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:55,958 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-01-11 11:13:55,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 11:13:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:55,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:56,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:56,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:13:56,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:56,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:56,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:56,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:56,025 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-01-11 11:13:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:56,476 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-01-11 11:13:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:13:56,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:56,477 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:13:56,477 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:13:56,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:13:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-01-11 11:13:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-11 11:13:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-01-11 11:13:56,500 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-01-11 11:13:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:56,500 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-01-11 11:13:56,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-01-11 11:13:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:56,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:56,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:56,501 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-11 11:13:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:56,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:56,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:56,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:56,598 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:56,598 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-11 11:13:56,600 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:56,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:56,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:56,603 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:56,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:56,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:56,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:56,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:56,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:56,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:56,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,643 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 31 treesize of output 40 [2019-01-11 11:13:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,670 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 27 treesize of output 42 [2019-01-11 11:13:56,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:56,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,744 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 18 treesize of output 21 [2019-01-11 11:13:56,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:13:56,750 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 23 treesize of output 37 [2019-01-11 11:13:56,773 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 25 treesize of output 51 [2019-01-11 11:13:56,779 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:56,780 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,796 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,809 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,820 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,829 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,850 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-01-11 11:13:56,850 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:56,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,875 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-01-11 11:13:56,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,893 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-01-11 11:13:56,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:56,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:56,914 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-01-11 11:13:56,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:56,936 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-01-11 11:13:56,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 11:13:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:56,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:56,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:56,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:56,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:56,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:56,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:56,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:56,981 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-01-11 11:13:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:57,243 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-01-11 11:13:57,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:57,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:57,244 INFO L225 Difference]: With dead ends: 73 [2019-01-11 11:13:57,244 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 11:13:57,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:57,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 11:13:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-01-11 11:13:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:13:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-01-11 11:13:57,276 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-01-11 11:13:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:57,276 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-01-11 11:13:57,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:57,277 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-01-11 11:13:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:57,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:57,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:57,277 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:57,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:57,277 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-11 11:13:57,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:57,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:57,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:57,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:57,368 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:57,368 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-11 11:13:57,371 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:57,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:57,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:57,374 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:57,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:57,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:57,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 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-01-11 11:13:57,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:57,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:57,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:57,403 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 18 treesize of output 21 [2019-01-11 11:13:57,406 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 21 treesize of output 27 [2019-01-11 11:13:57,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,413 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 23 treesize of output 37 [2019-01-11 11:13:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,418 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 25 treesize of output 51 [2019-01-11 11:13:57,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:13:57,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,450 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,465 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,508 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 31 treesize of output 40 [2019-01-11 11:13:57,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:13:57,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:13:57,572 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,581 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,590 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,610 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-01-11 11:13:57,610 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:13:57,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,644 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-01-11 11:13:57,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,665 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-01-11 11:13:57,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:13:57,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:57,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:13:57,688 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-01-11 11:13:57,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:57,709 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-01-11 11:13:57,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 11:13:57,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:57,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:57,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-11 11:13:57,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:57,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:13:57,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:13:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:13:57,766 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-01-11 11:13:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:57,992 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-01-11 11:13:57,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:13:57,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-01-11 11:13:57,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:57,994 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:13:57,994 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:13:57,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:13:57,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:13:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-01-11 11:13:58,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-11 11:13:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-01-11 11:13:58,024 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-01-11 11:13:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:58,024 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-01-11 11:13:58,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:13:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-01-11 11:13:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:58,024 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:58,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:58,025 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-11 11:13:58,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:58,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:58,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:13:58,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 11:13:58,218 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:13:58,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:13:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:13:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:13:58,219 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-01-11 11:13:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:58,283 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-01-11 11:13:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:13:58,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:13:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:58,285 INFO L225 Difference]: With dead ends: 54 [2019-01-11 11:13:58,285 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 11:13:58,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:13:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 11:13:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-01-11 11:13:58,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:13:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-01-11 11:13:58,325 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-01-11 11:13:58,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:58,325 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-01-11 11:13:58,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:13:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-01-11 11:13:58,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:13:58,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:58,326 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:13:58,326 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:58,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:58,327 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-01-11 11:13:58,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:58,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:58,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:58,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:58,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:58,535 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-01-11 11:13:58,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:58,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:58,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:58,560 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 11:13:58,560 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-11 11:13:58,561 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:58,561 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:58,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:58,563 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:13:58,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:58,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:58,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:58,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:58,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:58,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:58,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:58,580 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 26 treesize of output 25 [2019-01-11 11:13:58,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,602 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 22 treesize of output 38 [2019-01-11 11:13:58,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:13:58,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,663 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 18 treesize of output 21 [2019-01-11 11:13:58,667 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 21 treesize of output 23 [2019-01-11 11:13:58,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:13:58,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:13:58,680 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:13:58,681 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,698 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,711 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,722 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,752 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-01-11 11:13:58,752 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:13:58,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:13:58,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:13:58,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:13:58,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-01-11 11:13:58,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:58,913 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 50 [2019-01-11 11:13:58,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:58,930 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-01-11 11:13:58,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-11 11:13:58,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:58,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:58,956 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:58,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:58,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:58,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:58,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:58,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:58,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:58,976 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-01-11 11:13:59,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:59,215 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-01-11 11:13:59,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:13:59,215 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 11:13:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:59,216 INFO L225 Difference]: With dead ends: 83 [2019-01-11 11:13:59,216 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 11:13:59,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:13:59,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 11:13:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-11 11:13:59,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 11:13:59,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-01-11 11:13:59,265 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-01-11 11:13:59,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:59,265 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-01-11 11:13:59,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:13:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-01-11 11:13:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:13:59,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:59,266 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:13:59,266 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:59,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:59,266 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-01-11 11:13:59,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:59,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:59,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:59,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:59,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:13:59,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:59,337 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:13:59,337 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-11 11:13:59,338 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:13:59,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:13:59,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:13:59,344 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:13:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:59,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:13:59,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:59,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:13:59,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:59,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:59,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:59,366 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 26 treesize of output 25 [2019-01-11 11:13:59,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,386 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 22 treesize of output 38 [2019-01-11 11:13:59,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:13:59,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,454 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 18 treesize of output 21 [2019-01-11 11:13:59,458 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 21 treesize of output 23 [2019-01-11 11:13:59,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:13:59,464 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 25 treesize of output 47 [2019-01-11 11:13:59,471 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:13:59,471 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,486 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,498 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,536 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-01-11 11:13:59,536 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:13:59,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:13:59,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,576 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-01-11 11:13:59,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:13:59,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:13:59,594 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 40 [2019-01-11 11:13:59,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:59,607 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-01-11 11:13:59,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-01-11 11:13:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:59,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:59,640 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:59,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:59,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:13:59,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:59,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:13:59,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:13:59,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:13:59,660 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-01-11 11:14:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:00,061 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-01-11 11:14:00,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:00,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:00,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:00,062 INFO L225 Difference]: With dead ends: 86 [2019-01-11 11:14:00,063 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:14:00,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:14:00,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-01-11 11:14:00,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 11:14:00,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-01-11 11:14:00,122 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-01-11 11:14:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:00,122 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-01-11 11:14:00,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:00,122 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-01-11 11:14:00,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:00,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:00,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:00,123 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:00,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:00,123 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-11 11:14:00,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:00,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:00,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:00,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:00,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:00,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:00,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:00,187 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:00,187 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-11 11:14:00,188 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:00,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:00,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:00,191 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:00,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:00,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:00,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:00,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:14:00,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:00,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:00,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:00,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,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, 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-01-11 11:14:00,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,291 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-01-11 11:14:00,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,342 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-01-11 11:14:00,488 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-11 11:14:00,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,504 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-01-11 11:14:00,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,529 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,606 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 18 treesize of output 21 [2019-01-11 11:14:00,611 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 21 treesize of output 27 [2019-01-11 11:14:00,613 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 23 treesize of output 37 [2019-01-11 11:14:00,616 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 25 treesize of output 51 [2019-01-11 11:14:00,619 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:00,620 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,666 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,683 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,694 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,703 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,732 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-01-11 11:14:00,732 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:14:00,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,802 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-01-11 11:14:00,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,832 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-01-11 11:14:00,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:00,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,868 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-01-11 11:14:00,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,898 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-01-11 11:14:00,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 11:14:00,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:00,935 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:00,936 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-01-11 11:14:00,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:00,968 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-01-11 11:14:00,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:14:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:01,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:01,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:01,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:01,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:01,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:01,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:01,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:01,080 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-01-11 11:14:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:01,574 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-01-11 11:14:01,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:01,574 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:01,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:01,576 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:14:01,576 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 11:14:01,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 11:14:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-01-11 11:14:01,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-11 11:14:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-01-11 11:14:01,650 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-01-11 11:14:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:01,650 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-01-11 11:14:01,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-01-11 11:14:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:01,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:01,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:01,651 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:01,651 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-11 11:14:01,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:01,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:01,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:01,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:01,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:01,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:01,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:01,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:01,723 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:01,723 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-11 11:14:01,724 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:01,724 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:01,727 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:01,728 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:01,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:01,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:01,728 INFO 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-01-11 11:14:01,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:01,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:01,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:01,749 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-01-11 11:14:01,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,769 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-01-11 11:14:01,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,813 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-01-11 11:14:01,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:01,861 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-01-11 11:14:01,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:14:01,960 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 21 treesize of output 23 [2019-01-11 11:14:01,963 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 23 treesize of output 33 [2019-01-11 11:14:01,965 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 25 treesize of output 47 [2019-01-11 11:14:01,969 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 27 treesize of output 62 [2019-01-11 11:14:01,969 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:01,989 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,001 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,011 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,020 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,047 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-01-11 11:14:02,047 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:14:02,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,092 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-01-11 11:14:02,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,109 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-01-11 11:14:02,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:14:02,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,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, 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 59 [2019-01-11 11:14:02,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,156 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-01-11 11:14:02,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:14:02,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,183 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:02,184 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-01-11 11:14:02,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:02,207 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-01-11 11:14:02,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:14:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:02,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:02,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:02,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:02,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:02,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:02,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:02,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:02,283 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-01-11 11:14:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:02,765 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-01-11 11:14:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:02,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:02,767 INFO L225 Difference]: With dead ends: 104 [2019-01-11 11:14:02,767 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 11:14:02,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:02,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 11:14:02,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-01-11 11:14:02,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 11:14:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-11 11:14:02,870 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-11 11:14:02,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:02,870 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-11 11:14:02,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-11 11:14:02,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:02,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:02,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:02,871 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:02,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:02,871 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-11 11:14:02,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:02,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:02,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:02,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:02,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:02,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:02,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:02,939 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:02,939 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-11 11:14:02,941 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:02,941 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:02,943 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:02,943 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:02,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:02,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:02,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:02,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:14:02,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:02,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:02,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:02,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:02,978 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 31 treesize of output 40 [2019-01-11 11:14:03,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,006 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 27 treesize of output 42 [2019-01-11 11:14:03,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:14:03,037 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,070 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 18 treesize of output 21 [2019-01-11 11:14:03,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:03,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:14:03,077 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 25 treesize of output 51 [2019-01-11 11:14:03,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:03,083 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,099 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,123 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,152 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-01-11 11:14:03,153 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:14:03,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,195 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-01-11 11:14:03,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,212 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-01-11 11:14:03,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:14:03,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,237 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 59 [2019-01-11 11:14:03,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,258 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-01-11 11:14:03,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:14:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:03,286 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:03,287 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-01-11 11:14:03,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:03,310 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-01-11 11:14:03,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:14:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:03,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:03,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:03,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:03,385 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:03,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:03,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:03,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:03,386 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-01-11 11:14:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:03,949 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-01-11 11:14:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:03,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:03,951 INFO L225 Difference]: With dead ends: 107 [2019-01-11 11:14:03,952 INFO L226 Difference]: Without dead ends: 106 [2019-01-11 11:14:03,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-11 11:14:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-01-11 11:14:04,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-11 11:14:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-01-11 11:14:04,058 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-01-11 11:14:04,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:04,058 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-01-11 11:14:04,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:04,059 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-01-11 11:14:04,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:04,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:04,059 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:04,060 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:04,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-01-11 11:14:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:04,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:04,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:04,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:04,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:04,194 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-11 11:14:04,197 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:04,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:04,199 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:04,199 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:04,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:04,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:04,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:04,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:14:04,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:04,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:04,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:04,216 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 18 treesize of output 21 [2019-01-11 11:14:04,238 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 21 treesize of output 23 [2019-01-11 11:14:04,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,246 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 23 treesize of output 33 [2019-01-11 11:14:04,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,255 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 25 treesize of output 47 [2019-01-11 11:14:04,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:14:04,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,344 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-01-11 11:14:04,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,360 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-01-11 11:14:04,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,395 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-01-11 11:14:04,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,441 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-01-11 11:14:04,441 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,455 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,484 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,512 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-01-11 11:14:04,513 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:14:04,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,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, 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-01-11 11:14:04,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,583 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-01-11 11:14:04,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:14:04,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:04,606 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-01-11 11:14:04,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:04,626 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-01-11 11:14:04,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-01-11 11:14:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:04,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:04,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:04,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:04,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:04,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:04,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:04,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:04,686 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-01-11 11:14:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:05,061 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-01-11 11:14:05,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:05,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:05,063 INFO L225 Difference]: With dead ends: 100 [2019-01-11 11:14:05,063 INFO L226 Difference]: Without dead ends: 98 [2019-01-11 11:14:05,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 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-01-11 11:14:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-11 11:14:05,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-01-11 11:14:05,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 11:14:05,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-01-11 11:14:05,163 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-01-11 11:14:05,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:05,163 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-01-11 11:14:05,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:05,164 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-01-11 11:14:05,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:05,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:05,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:05,164 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:05,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:05,165 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-11 11:14:05,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:05,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:05,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:05,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:05,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:05,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:05,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:05,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:05,289 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-11 11:14:05,290 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:05,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:05,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:05,292 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:05,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:05,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:05,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:05,293 INFO 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-01-11 11:14:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:05,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:05,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:05,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,327 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 31 treesize of output 40 [2019-01-11 11:14:05,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,372 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 27 treesize of output 42 [2019-01-11 11:14:05,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:14:05,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,445 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,466 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 18 treesize of output 21 [2019-01-11 11:14:05,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:05,470 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 23 treesize of output 37 [2019-01-11 11:14:05,471 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 25 treesize of output 51 [2019-01-11 11:14:05,483 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:05,483 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,508 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,527 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,538 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,557 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:05,582 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-01-11 11:14:05,582 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:14:05,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 11:14:05,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 11:14:05,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-01-11 11:14:05,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-01-11 11:14:05,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:05,940 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 51 treesize of output 65 [2019-01-11 11:14:05,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,027 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:06,028 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 65 [2019-01-11 11:14:06,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:06,101 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 63 [2019-01-11 11:14:06,101 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,150 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-01-11 11:14:06,150 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-01-11 11:14:06,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,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 43 treesize of output 69 [2019-01-11 11:14:06,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,280 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:06,280 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 39 treesize of output 53 [2019-01-11 11:14:06,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:06,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2019-01-11 11:14:06,337 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:06,386 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-01-11 11:14:06,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-01-11 11:14:06,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-01-11 11:14:06,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:06,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:06,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:06,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:06,509 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:06,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:06,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:06,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:06,510 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-01-11 11:14:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:07,431 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-11 11:14:07,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:07,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:07,433 INFO L225 Difference]: With dead ends: 124 [2019-01-11 11:14:07,434 INFO L226 Difference]: Without dead ends: 123 [2019-01-11 11:14:07,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:14:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-11 11:14:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-01-11 11:14:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-11 11:14:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-01-11 11:14:07,544 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-01-11 11:14:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:07,545 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-01-11 11:14:07,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:07,545 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-01-11 11:14:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:07,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:07,546 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:07,546 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:07,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:07,546 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-11 11:14:07,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:07,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:07,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:07,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:07,685 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:14:07,832 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 11:14:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:08,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:08,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:08,008 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:08,008 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-11 11:14:08,009 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:08,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:08,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:08,012 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:08,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:08,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:08,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:08,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:14:08,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:08,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:08,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:08,163 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-11 11:14:08,165 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 18 treesize of output 21 [2019-01-11 11:14:08,168 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 21 treesize of output 27 [2019-01-11 11:14:08,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,173 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 23 treesize of output 37 [2019-01-11 11:14:08,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,180 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 25 treesize of output 51 [2019-01-11 11:14:08,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:08,195 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,284 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-01-11 11:14:08,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,316 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-01-11 11:14:08,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,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, 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-01-11 11:14:08,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,406 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-01-11 11:14:08,406 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,423 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,439 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,455 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,485 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-01-11 11:14:08,486 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:14:08,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,516 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-01-11 11:14:08,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,545 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-01-11 11:14:08,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:08,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,727 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:08,727 INFO L303 Elim1Store]: Index analysis took 157 ms [2019-01-11 11:14:08,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, 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-01-11 11:14:08,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,765 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-01-11 11:14:08,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:14:08,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:08,796 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:08,796 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-01-11 11:14:08,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:08,826 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-01-11 11:14:08,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 11:14:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:08,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:08,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:08,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:08,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:14:08,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:08,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:14:08,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:14:08,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:08,908 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-01-11 11:14:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:09,493 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-01-11 11:14:09,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:09,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:14:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:09,495 INFO L225 Difference]: With dead ends: 114 [2019-01-11 11:14:09,495 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 11:14:09,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:09,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 11:14:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-01-11 11:14:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:14:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-01-11 11:14:09,645 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-01-11 11:14:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:09,645 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-01-11 11:14:09,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:14:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-01-11 11:14:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:09,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:09,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:09,646 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:09,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:09,646 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-01-11 11:14:09,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:09,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:09,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:09,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:09,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:09,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:09,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:09,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:09,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:09,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:14:09,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:14:09,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:14:09,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:14:09,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:09,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:09,780 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 18 treesize of output 21 [2019-01-11 11:14:09,782 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 21 treesize of output 27 [2019-01-11 11:14:09,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,789 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 23 treesize of output 37 [2019-01-11 11:14:09,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,796 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 25 treesize of output 51 [2019-01-11 11:14:09,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,810 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:09,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,837 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,862 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:09,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,899 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-01-11 11:14:09,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,933 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-01-11 11:14:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:09,971 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-01-11 11:14:10,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,021 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-01-11 11:14:10,022 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,039 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,056 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,074 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,109 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-01-11 11:14:10,109 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-01-11 11:14:10,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,131 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-01-11 11:14:10,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,158 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-01-11 11:14:10,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,184 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-01-11 11:14:10,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,214 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-01-11 11:14:10,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:14:10,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:10,244 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:10,245 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-01-11 11:14:10,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:10,276 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-01-11 11:14:10,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 11:14:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:10,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:10,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:10,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:10,342 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:10,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:10,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:10,343 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-01-11 11:14:10,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:10,935 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-01-11 11:14:10,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:14:10,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:10,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:10,938 INFO L225 Difference]: With dead ends: 164 [2019-01-11 11:14:10,938 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 11:14:10,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:10,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 11:14:11,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-01-11 11:14:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 11:14:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-01-11 11:14:11,165 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-01-11 11:14:11,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:11,165 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-01-11 11:14:11,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-01-11 11:14:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:11,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:11,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:11,166 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:11,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:11,167 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-01-11 11:14:11,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:11,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:11,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:11,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:11,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:11,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:11,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:11,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:11,225 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-11 11:14:11,226 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:11,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:11,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:11,229 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:11,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:11,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:11,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:11,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:14:11,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:11,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:11,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:11,249 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-01-11 11:14:11,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,274 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-01-11 11:14:11,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,309 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-01-11 11:14:11,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,354 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-01-11 11:14:11,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,419 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 18 treesize of output 21 [2019-01-11 11:14:11,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:11,425 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 23 treesize of output 33 [2019-01-11 11:14:11,428 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 25 treesize of output 47 [2019-01-11 11:14:11,432 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 27 treesize of output 62 [2019-01-11 11:14:11,432 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,457 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,478 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,488 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,514 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-01-11 11:14:11,515 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:14:11,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,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, 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-01-11 11:14:11,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:11,565 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-01-11 11:14:11,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:14:11,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:11,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, 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-01-11 11:14:11,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:11,696 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-01-11 11:14:11,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:14:11,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:11,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:11,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:11,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:11,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:11,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:11,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:11,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:11,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:11,767 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-01-11 11:14:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:12,270 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-01-11 11:14:12,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:12,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:12,273 INFO L225 Difference]: With dead ends: 160 [2019-01-11 11:14:12,273 INFO L226 Difference]: Without dead ends: 159 [2019-01-11 11:14:12,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-11 11:14:12,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-01-11 11:14:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-11 11:14:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-01-11 11:14:12,515 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-01-11 11:14:12,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:12,515 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-01-11 11:14:12,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-01-11 11:14:12,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:12,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:12,516 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:12,517 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-01-11 11:14:12,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:12,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:12,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:12,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:12,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:12,612 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:12,612 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-11 11:14:12,613 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:12,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:12,615 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:12,616 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:12,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:12,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:12,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 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-01-11 11:14:12,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:12,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:12,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:12,637 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 18 treesize of output 21 [2019-01-11 11:14:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:14:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,647 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 23 treesize of output 33 [2019-01-11 11:14:12,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,654 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 25 treesize of output 47 [2019-01-11 11:14:12,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:14:12,669 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,687 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,749 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 26 treesize of output 25 [2019-01-11 11:14:12,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:14:12,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:14:12,790 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,799 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,807 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,825 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-01-11 11:14:12,826 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:14:12,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,857 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:14:12,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,868 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-01-11 11:14:12,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:14:12,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:12,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 11:14:12,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:12,900 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-01-11 11:14:12,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-11 11:14:12,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:12,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:12,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:12,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:14:12,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:12,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:12,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:12,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:12,951 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-01-11 11:14:13,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:13,769 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-01-11 11:14:13,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:13,770 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:13,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:13,772 INFO L225 Difference]: With dead ends: 175 [2019-01-11 11:14:13,772 INFO L226 Difference]: Without dead ends: 174 [2019-01-11 11:14:13,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-11 11:14:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-01-11 11:14:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 11:14:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-11 11:14:14,005 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-11 11:14:14,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:14,005 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-11 11:14:14,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-11 11:14:14,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:14,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:14,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:14,006 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:14,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:14,006 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-11 11:14:14,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:14,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:14,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:14,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:14:14,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:14:14,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:14:14,127 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:14:14,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:14:14,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:14:14,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:14:14,128 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-01-11 11:14:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:14,502 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-01-11 11:14:14,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:14:14,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-11 11:14:14,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:14,503 INFO L225 Difference]: With dead ends: 185 [2019-01-11 11:14:14,503 INFO L226 Difference]: Without dead ends: 184 [2019-01-11 11:14:14,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:14:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-11 11:14:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-01-11 11:14:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 11:14:14,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-01-11 11:14:14,748 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-01-11 11:14:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:14,748 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-01-11 11:14:14,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:14:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-01-11 11:14:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:14,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:14,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:14,749 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:14,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:14,750 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-01-11 11:14:14,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:14,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:14,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:14,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:14,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:14,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:14,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:14,801 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:14,801 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-11 11:14:14,802 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:14,802 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:14,803 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:14,804 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:14,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:14,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:14,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:14,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 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-01-11 11:14:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:14,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:14,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:14,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 26 treesize of output 25 [2019-01-11 11:14:14,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,841 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 22 treesize of output 38 [2019-01-11 11:14:14,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:14,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:14:14,874 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,903 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 18 treesize of output 21 [2019-01-11 11:14:14,907 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 21 treesize of output 23 [2019-01-11 11:14:14,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:14:14,912 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 25 treesize of output 47 [2019-01-11 11:14:14,919 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:14:14,920 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,935 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,947 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,966 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:14,985 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-01-11 11:14:14,985 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:14:15,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,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, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-01-11 11:14:15,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,025 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-01-11 11:14:15,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-11 11:14:15,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:15,042 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:15,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-01-11 11:14:15,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:15,055 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-01-11 11:14:15,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-11 11:14:15,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:15,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:15,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:15,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:15,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:15,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:15,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:15,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:15,108 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-01-11 11:14:15,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:15,588 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-01-11 11:14:15,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:14:15,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:15,590 INFO L225 Difference]: With dead ends: 142 [2019-01-11 11:14:15,590 INFO L226 Difference]: Without dead ends: 141 [2019-01-11 11:14:15,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-11 11:14:15,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-01-11 11:14:15,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-11 11:14:15,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-01-11 11:14:15,998 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-01-11 11:14:15,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:15,998 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-01-11 11:14:15,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:15,999 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-01-11 11:14:15,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:15,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:15,999 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 11:14:15,999 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-01-11 11:14:16,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:16,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:16,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:16,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:16,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:16,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:16,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:16,102 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:16,102 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-11 11:14:16,102 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:16,103 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:16,105 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:16,105 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 58 root evaluator evaluations with a maximum evaluation depth of 2. Performed 58 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:16,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:16,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:16,105 INFO 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-01-11 11:14:16,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:16,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:16,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:16,127 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 18 treesize of output 21 [2019-01-11 11:14:16,131 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 21 treesize of output 23 [2019-01-11 11:14:16,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,140 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 23 treesize of output 33 [2019-01-11 11:14:16,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,149 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 25 treesize of output 47 [2019-01-11 11:14:16,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,158 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 27 treesize of output 62 [2019-01-11 11:14:16,158 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,187 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,207 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,237 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-01-11 11:14:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,253 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-01-11 11:14:16,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,286 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-01-11 11:14:16,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,330 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-01-11 11:14:16,331 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,344 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,358 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,373 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,401 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-01-11 11:14:16,401 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:14:16,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,430 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-01-11 11:14:16,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:16,520 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-01-11 11:14:16,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 11:14:16,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,553 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 59 [2019-01-11 11:14:16,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,576 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-01-11 11:14:16,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-01-11 11:14:16,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:16,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 11:14:16,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:16,627 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-01-11 11:14:16,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:14:16,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:16,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:16,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:16,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-11 11:14:16,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:16,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:14:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:14:16,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:16,686 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-01-11 11:14:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:17,392 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-01-11 11:14:17,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:17,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 11:14:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:17,395 INFO L225 Difference]: With dead ends: 219 [2019-01-11 11:14:17,395 INFO L226 Difference]: Without dead ends: 216 [2019-01-11 11:14:17,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:17,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-11 11:14:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-01-11 11:14:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-01-11 11:14:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-01-11 11:14:17,679 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-01-11 11:14:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:17,679 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-01-11 11:14:17,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:14:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-01-11 11:14:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:17,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:17,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:17,680 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-01-11 11:14:17,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:17,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:17,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:17,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:17,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:17,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:17,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:14:17,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:14:17,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:17,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:14:17,769 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:14:17,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:14:17,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:14:17,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:14:17,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:17,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,791 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 31 treesize of output 40 [2019-01-11 11:14:17,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,830 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 27 treesize of output 42 [2019-01-11 11:14:17,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:17,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:14:17,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,899 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 18 treesize of output 21 [2019-01-11 11:14:17,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:14:17,904 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 23 treesize of output 37 [2019-01-11 11:14:17,909 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 25 treesize of output 51 [2019-01-11 11:14:17,914 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:14:17,915 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,931 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,942 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,963 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:17,983 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-01-11 11:14:17,984 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-01-11 11:14:18,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,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, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-11 11:14:18,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:18,118 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-01-11 11:14:18,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-01-11 11:14:18,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,179 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 50 treesize of output 80 [2019-01-11 11:14:18,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:18,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,295 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 48 treesize of output 74 [2019-01-11 11:14:18,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-11 11:14:18,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-01-11 11:14:18,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,418 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:18,434 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 4 case distinctions, treesize of input 42 treesize of output 88 [2019-01-11 11:14:18,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-01-11 11:14:18,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,609 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:18,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,610 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 65 [2019-01-11 11:14:18,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:18,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-01-11 11:14:18,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:18,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-01-11 11:14:18,802 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-01-11 11:14:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:18,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:18,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:18,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:18,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:14:18,978 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:18,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:18,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:18,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:14:18,978 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-01-11 11:14:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:20,138 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-01-11 11:14:20,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:20,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:20,141 INFO L225 Difference]: With dead ends: 218 [2019-01-11 11:14:20,142 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 11:14:20,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:14:20,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 11:14:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-01-11 11:14:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-11 11:14:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-01-11 11:14:20,480 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-01-11 11:14:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:20,480 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-01-11 11:14:20,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-01-11 11:14:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:20,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:20,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:20,481 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:20,482 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-01-11 11:14:20,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:20,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:20,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:14:20,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:20,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:20,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:20,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:20,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:20,529 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-11 11:14:20,530 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:20,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:20,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:20,533 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:20,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:20,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:20,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:20,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 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-01-11 11:14:20,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:20,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:20,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:20,555 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-01-11 11:14:20,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,581 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-01-11 11:14:20,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,616 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-01-11 11:14:20,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:20,660 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-01-11 11:14:20,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:20,735 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 18 treesize of output 21 [2019-01-11 11:14:20,742 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 21 treesize of output 23 [2019-01-11 11:14:20,747 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 23 treesize of output 33 [2019-01-11 11:14:20,750 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 25 treesize of output 47 [2019-01-11 11:14:20,757 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 27 treesize of output 62 [2019-01-11 11:14:20,758 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,141 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,151 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,160 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,170 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,196 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-01-11 11:14:21,197 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:14:21,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,221 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-01-11 11:14:21,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,250 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-01-11 11:14:21,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:14:21,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:21,273 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-01-11 11:14:21,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:21,301 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-01-11 11:14:21,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-11 11:14:21,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:21,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:21,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:21,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:14:21,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:21,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:21,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:14:21,348 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-01-11 11:14:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:22,152 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-01-11 11:14:22,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:22,152 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 11:14:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:22,155 INFO L225 Difference]: With dead ends: 274 [2019-01-11 11:14:22,155 INFO L226 Difference]: Without dead ends: 269 [2019-01-11 11:14:22,155 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-01-11 11:14:22,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-11 11:14:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-01-11 11:14:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 11:14:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-01-11 11:14:22,658 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-01-11 11:14:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:22,658 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-01-11 11:14:22,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:22,658 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-01-11 11:14:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:14:22,659 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:22,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:14:22,660 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:22,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:22,660 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-01-11 11:14:22,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:22,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:22,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:22,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:22,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:22,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:22,805 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 11:14:22,806 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-11 11:14:22,807 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:22,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:22,809 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:22,809 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:22,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:22,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:22,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:22,810 INFO 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-01-11 11:14:22,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:22,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:22,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:22,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:22,837 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 18 treesize of output 21 [2019-01-11 11:14:22,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 21 treesize of output 23 [2019-01-11 11:14:22,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,850 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 23 treesize of output 33 [2019-01-11 11:14:22,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:14:22,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,897 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 27 treesize of output 62 [2019-01-11 11:14:22,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,921 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,945 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,955 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:22,976 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-01-11 11:14:22,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:22,992 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-01-11 11:14:23,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,029 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-01-11 11:14:23,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,072 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-01-11 11:14:23,073 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,085 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,099 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,114 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,140 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-01-11 11:14:23,141 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:14:23,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,167 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-01-11 11:14:23,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,193 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-01-11 11:14:23,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:14:23,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,229 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-01-11 11:14:23,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:23,323 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-01-11 11:14:23,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 11:14:23,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:23,375 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:23,376 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 83 [2019-01-11 11:14:23,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:23,398 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-01-11 11:14:23,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-11 11:14:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:23,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:23,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:23,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 11:14:23,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:23,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:23,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:23,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:23,449 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-01-11 11:14:24,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:24,973 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-01-11 11:14:24,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:14:24,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 11:14:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:24,978 INFO L225 Difference]: With dead ends: 480 [2019-01-11 11:14:24,978 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 11:14:24,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:24,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 11:14:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-01-11 11:14:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-01-11 11:14:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-01-11 11:14:25,841 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-01-11 11:14:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:25,841 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-01-11 11:14:25,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-01-11 11:14:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:25,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:25,842 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:14:25,842 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-01-11 11:14:25,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:25,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:25,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:25,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:25,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:25,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:25,871 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-01-11 11:14:25,872 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:25,872 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:25,874 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:25,875 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 2. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:14:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:25,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:25,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:25,875 INFO 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-01-11 11:14:25,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:25,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:25,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:25,893 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 18 treesize of output 21 [2019-01-11 11:14:25,901 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 21 treesize of output 23 [2019-01-11 11:14:25,907 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 23 treesize of output 25 [2019-01-11 11:14:25,920 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 25 treesize of output 27 [2019-01-11 11:14:25,942 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 11:14:25,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:25,955 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:25,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:25,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:25,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,009 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-01-11 11:14:26,010 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 11:14:26,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,034 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-01-11 11:14:26,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 11:14:26,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:26,041 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 18 treesize of output 5 [2019-01-11 11:14:26,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:26,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-01-11 11:14:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:26,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:26,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:26,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:14:26,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-01-11 11:14:26,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:14:26,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:14:26,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:14:26,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:14:26,079 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-01-11 11:14:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:28,030 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-01-11 11:14:28,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:14:28,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-11 11:14:28,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:28,037 INFO L225 Difference]: With dead ends: 804 [2019-01-11 11:14:28,037 INFO L226 Difference]: Without dead ends: 800 [2019-01-11 11:14:28,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:14:28,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-01-11 11:14:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-01-11 11:14:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-01-11 11:14:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-01-11 11:14:30,099 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-01-11 11:14:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:30,099 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-01-11 11:14:30,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:14:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-01-11 11:14:30,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:30,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:30,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:30,102 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:30,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-11 11:14:30,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:30,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:30,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:30,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:30,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:30,270 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 11:14:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:30,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:30,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:30,416 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:30,417 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-11 11:14:30,418 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:30,418 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:30,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:30,420 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:14:30,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:30,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:30,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:30,421 INFO 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-01-11 11:14:30,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:30,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:30,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:30,454 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 18 treesize of output 21 [2019-01-11 11:14:30,456 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 21 treesize of output 27 [2019-01-11 11:14:30,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,461 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 23 treesize of output 37 [2019-01-11 11:14:30,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,467 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 25 treesize of output 51 [2019-01-11 11:14:30,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,476 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:30,477 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,608 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-01-11 11:14:30,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,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, 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-01-11 11:14:30,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,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 32 treesize of output 61 [2019-01-11 11:14:30,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,731 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-01-11 11:14:30,731 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,747 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,763 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,778 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,807 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 11:14:30,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,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, 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-01-11 11:14:30,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,868 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-01-11 11:14:30,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:30,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,910 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-01-11 11:14:30,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:30,942 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-01-11 11:14:30,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:14:30,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:30,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,012 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:31,012 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-01-11 11:14:31,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,052 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-01-11 11:14:31,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:14:31,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:31,091 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:31,092 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-01-11 11:14:31,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:31,130 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-01-11 11:14:31,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:14:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:31,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:31,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:31,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:31,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:14:31,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:31,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:31,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:31,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:14:31,244 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-01-11 11:14:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:33,905 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-01-11 11:14:33,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:14:33,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:33,912 INFO L225 Difference]: With dead ends: 821 [2019-01-11 11:14:33,912 INFO L226 Difference]: Without dead ends: 820 [2019-01-11 11:14:33,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:14:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-01-11 11:14:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-01-11 11:14:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-01-11 11:14:35,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-01-11 11:14:35,862 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-01-11 11:14:35,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:35,862 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-01-11 11:14:35,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:14:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-01-11 11:14:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:35,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:35,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:35,865 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:35,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:35,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-11 11:14:35,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:35,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:35,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:35,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:35,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:35,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:35,916 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:35,916 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-11 11:14:35,917 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:35,917 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:35,919 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:35,919 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:35,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:35,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:35,920 INFO 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-01-11 11:14:35,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:35,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:35,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:35,937 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 17 treesize of output 20 [2019-01-11 11:14:35,944 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 20 treesize of output 22 [2019-01-11 11:14:35,952 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 22 treesize of output 24 [2019-01-11 11:14:35,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:35,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-11 11:14:35,978 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:35,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,018 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 18 treesize of output 21 [2019-01-11 11:14:36,021 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 21 treesize of output 23 [2019-01-11 11:14:36,024 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 23 treesize of output 25 [2019-01-11 11:14:36,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 25 treesize of output 27 [2019-01-11 11:14:36,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, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:14:36,041 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,055 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,064 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,081 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,093 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,114 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-01-11 11:14:36,114 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-01-11 11:14:36,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-01-11 11:14:36,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-11 11:14:36,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:36,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-11 11:14:36,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:36,193 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-01-11 11:14:36,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-11 11:14:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:36,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:36,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:36,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:36,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:14:36,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:36,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:14:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:14:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:36,281 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-01-11 11:14:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:38,404 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-01-11 11:14:38,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:14:38,405 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:14:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:38,411 INFO L225 Difference]: With dead ends: 805 [2019-01-11 11:14:38,411 INFO L226 Difference]: Without dead ends: 804 [2019-01-11 11:14:38,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:14:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-01-11 11:14:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-01-11 11:14:40,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-01-11 11:14:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-01-11 11:14:40,473 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-01-11 11:14:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:40,473 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-01-11 11:14:40,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:14:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-01-11 11:14:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:40,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:40,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:40,476 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:40,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-01-11 11:14:40,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:40,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:40,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:40,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:14:40,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:40,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:40,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:40,605 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-11 11:14:40,606 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:40,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:40,608 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:40,608 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:14:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:40,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:40,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:40,609 INFO 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-01-11 11:14:40,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:40,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:40,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:40,638 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 18 treesize of output 21 [2019-01-11 11:14:40,642 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 21 treesize of output 23 [2019-01-11 11:14:40,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,650 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 23 treesize of output 33 [2019-01-11 11:14:40,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,662 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 25 treesize of output 47 [2019-01-11 11:14:40,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,671 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 27 treesize of output 62 [2019-01-11 11:14:40,671 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,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, 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-01-11 11:14:40,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,772 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-01-11 11:14:40,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,805 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-01-11 11:14:40,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,860 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-01-11 11:14:40,861 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,889 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,905 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,931 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-01-11 11:14:40,932 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:14:40,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:40,976 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-01-11 11:14:40,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:40,993 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-01-11 11:14:40,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:14:41,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,025 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 59 [2019-01-11 11:14:41,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,043 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-01-11 11:14:41,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:14:41,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,070 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:41,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:41,072 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 72 [2019-01-11 11:14:41,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:41,095 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-01-11 11:14:41,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:14:41,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:41,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:41,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:41,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:14:41,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:41,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:14:41,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:14:41,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:14:41,182 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-01-11 11:14:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:44,112 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-01-11 11:14:44,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:44,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:14:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:44,122 INFO L225 Difference]: With dead ends: 1004 [2019-01-11 11:14:44,123 INFO L226 Difference]: Without dead ends: 1003 [2019-01-11 11:14:44,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:44,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-01-11 11:14:46,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-01-11 11:14:46,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-01-11 11:14:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-01-11 11:14:46,408 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-01-11 11:14:46,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:46,409 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-01-11 11:14:46,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:14:46,409 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-01-11 11:14:46,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:46,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:46,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:46,412 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-01-11 11:14:46,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:46,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:46,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:46,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:46,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:46,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:46,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:46,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:46,557 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-11 11:14:46,557 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:46,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:46,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:46,563 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:14:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:46,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:46,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:46,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:14:46,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:46,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:46,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14: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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-01-11 11:14:46,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,593 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 22 treesize of output 38 [2019-01-11 11:14:46,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:14:46,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,653 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 18 treesize of output 21 [2019-01-11 11:14:46,657 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 21 treesize of output 23 [2019-01-11 11:14:46,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:14:46,664 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 25 treesize of output 47 [2019-01-11 11:14:46,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, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:14:46,682 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,698 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,710 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,729 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,748 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-01-11 11:14:46,748 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-01-11 11:14:46,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,777 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-01-11 11:14:46,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:46,798 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-01-11 11:14:46,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-01-11 11:14:46,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:46,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-01-11 11:14:46,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:14:46,889 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-01-11 11:14:46,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-01-11 11:14:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:46,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:46,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:46,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 11:14:46,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:46,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:14:46,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:14:46,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:46,956 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-01-11 11:14:50,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:50,232 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-01-11 11:14:50,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:14:50,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:14:50,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:50,241 INFO L225 Difference]: With dead ends: 1213 [2019-01-11 11:14:50,241 INFO L226 Difference]: Without dead ends: 1212 [2019-01-11 11:14:50,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:14:50,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-01-11 11:14:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-01-11 11:14:53,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-01-11 11:14:53,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-01-11 11:14:53,181 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-01-11 11:14:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:14:53,182 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-01-11 11:14:53,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:14:53,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-01-11 11:14:53,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:14:53,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:14:53,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:14:53,184 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:14:53,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:53,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-01-11 11:14:53,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:14:53,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:53,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:53,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:14:53,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:14:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:53,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:53,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:14:53,350 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:14:53,351 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-11 11:14:53,353 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:14:53,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:14:53,355 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:14:53,355 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:14:53,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:14:53,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:14:53,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:14:53,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 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-01-11 11:14:53,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:14:53,374 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:14:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:14:53,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:53,406 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 18 treesize of output 21 [2019-01-11 11:14:53,409 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 21 treesize of output 27 [2019-01-11 11:14:53,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,420 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 23 treesize of output 37 [2019-01-11 11:14:53,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:14:53,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,437 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:14:53,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,463 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,523 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-01-11 11:14:53,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,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, 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-01-11 11:14:53,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,594 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-01-11 11:14:53,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,640 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-01-11 11:14:53,641 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,658 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,673 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,719 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-01-11 11:14:53,720 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:14:53,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,752 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-01-11 11:14:53,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,782 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-01-11 11:14:53,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:14:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,848 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:53,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, 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-01-11 11:14:53,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,884 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-01-11 11:14:53,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-01-11 11:14:53,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,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, 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 82 [2019-01-11 11:14:53,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:53,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-01-11 11:14:53,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-01-11 11:14:53,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:53,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:14:54,001 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:14:54,002 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 96 [2019-01-11 11:14:54,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:14:54,043 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-01-11 11:14:54,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 11:14:54,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:54,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:14:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:54,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:14:54,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:14:54,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:14:54,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:14:54,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:14:54,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:14:54,131 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-01-11 11:14:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:14:58,530 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-01-11 11:14:58,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:14:58,530 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:14:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:14:58,545 INFO L225 Difference]: With dead ends: 1577 [2019-01-11 11:14:58,545 INFO L226 Difference]: Without dead ends: 1575 [2019-01-11 11:14:58,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:14:58,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-01-11 11:15:00,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-01-11 11:15:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-01-11 11:15:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-01-11 11:15:00,619 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-01-11 11:15:00,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:00,619 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-01-11 11:15:00,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-01-11 11:15:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:00,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:00,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:00,621 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-01-11 11:15:00,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:00,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:00,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:00,773 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:15:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:00,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:00,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:00,922 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-11 11:15:00,923 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:00,923 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:00,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:00,926 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:15:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:00,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:00,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:00,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 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-01-11 11:15:00,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:00,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:00,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:00,962 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 18 treesize of output 21 [2019-01-11 11:15:00,965 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 21 treesize of output 27 [2019-01-11 11:15:00,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,971 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 23 treesize of output 37 [2019-01-11 11:15:00,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:00,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, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-11 11:15:00,984 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:15:00,984 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,060 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 31 treesize of output 40 [2019-01-11 11:15:01,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,086 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 27 treesize of output 42 [2019-01-11 11:15:01,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:15:01,118 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,127 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,136 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,156 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-01-11 11:15:01,156 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:15:01,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,202 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-01-11 11:15:01,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,220 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-01-11 11:15:01,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:15:01,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,245 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:01,245 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-01-11 11:15:01,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,266 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-01-11 11:15:01,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-11 11:15:01,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,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, 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-01-11 11:15:01,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,312 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-01-11 11:15:01,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:15:01,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:01,340 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:01,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, 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-01-11 11:15:01,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:01,365 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-01-11 11:15:01,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:15:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:01,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:01,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:01,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:15:01,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:01,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:01,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:15:01,453 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-01-11 11:15:04,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:04,851 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-01-11 11:15:04,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:04,851 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:15:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:04,858 INFO L225 Difference]: With dead ends: 1108 [2019-01-11 11:15:04,858 INFO L226 Difference]: Without dead ends: 1107 [2019-01-11 11:15:04,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:15:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-01-11 11:15:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-01-11 11:15:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-11 11:15:07,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-01-11 11:15:07,732 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-01-11 11:15:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:07,732 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-01-11 11:15:07,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:07,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-01-11 11:15:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:07,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:07,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:07,734 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:07,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-01-11 11:15:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:07,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:07,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:07,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:07,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:07,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:07,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:07,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:07,817 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-11 11:15:07,818 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:07,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:07,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:07,820 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:07,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:07,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:07,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:07,820 INFO 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-01-11 11:15:07,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:07,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:07,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:07,842 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 18 treesize of output 21 [2019-01-11 11:15:07,847 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 21 treesize of output 23 [2019-01-11 11:15:07,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,857 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 23 treesize of output 33 [2019-01-11 11:15:07,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,864 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 25 treesize of output 47 [2019-01-11 11:15:07,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,873 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 27 treesize of output 62 [2019-01-11 11:15:07,874 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,910 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,921 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:07,953 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-01-11 11:15:07,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:07,970 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-01-11 11:15:08,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,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-01-11 11:15:08,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,053 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-01-11 11:15:08,054 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,068 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,082 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,097 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,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-01-11 11:15:08,124 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:15:08,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,149 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-01-11 11:15:08,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:08,175 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-01-11 11:15:08,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:15:08,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:08,203 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:08,211 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 80 [2019-01-11 11:15:08,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:08,305 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-01-11 11:15:08,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:15:08,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:08,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:08,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-01-11 11:15:08,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:08,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:15:08,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:08,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:08,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:08,377 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-01-11 11:15:11,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:11,477 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-01-11 11:15:11,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:15:11,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:15:11,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:11,482 INFO L225 Difference]: With dead ends: 1075 [2019-01-11 11:15:11,482 INFO L226 Difference]: Without dead ends: 1074 [2019-01-11 11:15:11,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 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-01-11 11:15:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-01-11 11:15:14,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-01-11 11:15:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-01-11 11:15:14,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-01-11 11:15:14,364 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-01-11 11:15:14,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:14,364 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-01-11 11:15:14,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-01-11 11:15:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:14,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:14,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:14,366 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:14,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-01-11 11:15:14,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:14,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:14,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:14,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:14,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:14,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:14,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:14,466 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:14,466 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-11 11:15:14,467 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:14,467 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:14,470 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:14,470 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:15:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:14,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:14,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:14,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 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-01-11 11:15:14,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:14,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:14,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:14,510 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 18 treesize of output 21 [2019-01-11 11:15:14,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:15:14,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:15:14,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,528 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 25 treesize of output 51 [2019-01-11 11:15:14,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:15:14,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,580 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,630 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-01-11 11:15:14,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,664 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-01-11 11:15:14,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,701 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-01-11 11:15:14,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,751 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-01-11 11:15:14,752 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,768 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,784 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,800 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,831 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-01-11 11:15:14,831 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:15:14,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,862 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-01-11 11:15:14,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:14,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-01-11 11:15:14,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:15:14,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:14,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:15,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:15,068 INFO L303 Elim1Store]: Index analysis took 155 ms [2019-01-11 11:15:15,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, 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-01-11 11:15:15,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:15,372 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-01-11 11:15:15,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 11:15:16,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,764 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-01-11 11:15:16,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,799 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-01-11 11:15:16,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 11:15:16,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:16,833 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:16,834 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-01-11 11:15:16,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:16,867 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-01-11 11:15:16,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:15:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:16,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:16,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:16,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:15:16,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:16,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:15:16,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:15:16,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:16,966 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-01-11 11:15:21,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:21,648 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-01-11 11:15:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:15:21,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:15:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:21,656 INFO L225 Difference]: With dead ends: 1522 [2019-01-11 11:15:21,656 INFO L226 Difference]: Without dead ends: 1521 [2019-01-11 11:15:21,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:15:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-01-11 11:15:24,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-01-11 11:15:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-01-11 11:15:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-01-11 11:15:24,887 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-01-11 11:15:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:24,888 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-01-11 11:15:24,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:15:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-01-11 11:15:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:24,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:24,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:24,890 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:24,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-11 11:15:24,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:24,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:24,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:24,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:24,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:24,925 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:24,926 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-11 11:15:24,926 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:24,926 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:24,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:24,928 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:15:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:24,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:24,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:24,928 INFO 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-01-11 11:15:24,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:24,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:24,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:24,951 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 18 treesize of output 21 [2019-01-11 11:15:24,960 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 21 treesize of output 23 [2019-01-11 11:15:24,968 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 23 treesize of output 25 [2019-01-11 11:15:24,983 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 25 treesize of output 27 [2019-01-11 11:15:25,000 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-11 11:15:25,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,012 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,050 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-01-11 11:15:25,050 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-11 11:15:25,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:25,055 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-01-11 11:15:25,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:25,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 11:15:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:25,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:25,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:25,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 11:15:25,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 11:15:25,102 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:15:25,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:15:25,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:15:25,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:15:25,102 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-01-11 11:15:29,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:29,199 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-01-11 11:15:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:15:29,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 11:15:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:29,207 INFO L225 Difference]: With dead ends: 1559 [2019-01-11 11:15:29,208 INFO L226 Difference]: Without dead ends: 1554 [2019-01-11 11:15:29,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:15:29,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-01-11 11:15:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-01-11 11:15:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-01-11 11:15:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-01-11 11:15:33,620 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-01-11 11:15:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:33,620 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-01-11 11:15:33,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:15:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-01-11 11:15:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:33,623 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:33,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:33,624 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:33,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:33,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-11 11:15:33,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:33,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:33,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:33,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:33,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:33,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:33,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:33,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:33,684 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-11 11:15:33,686 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:33,686 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:33,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:33,688 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:33,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:33,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:33,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:33,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:15:33,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:33,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:33,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:33,744 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 18 treesize of output 21 [2019-01-11 11:15:33,781 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 21 treesize of output 23 [2019-01-11 11:15:33,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,787 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 23 treesize of output 33 [2019-01-11 11:15:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,794 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 25 treesize of output 47 [2019-01-11 11:15:33,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15: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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:15:33,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:33,827 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:33,839 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:33,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:33,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:33,882 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-01-11 11:15:33,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:33,968 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-01-11 11:15:33,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,004 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-01-11 11:15:34,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,056 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-01-11 11:15:34,056 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,069 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,083 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,098 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,124 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-01-11 11:15:34,124 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:15:34,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,151 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-01-11 11:15:34,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:34,179 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-01-11 11:15:34,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:15:34,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:34,218 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-01-11 11:15:34,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:34,314 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-01-11 11:15:34,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:15:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:34,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:34,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:34,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 11:15:34,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:34,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:34,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:34,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:15:34,384 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-01-11 11:15:38,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:38,805 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-01-11 11:15:38,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:15:38,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:15:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:38,812 INFO L225 Difference]: With dead ends: 1574 [2019-01-11 11:15:38,812 INFO L226 Difference]: Without dead ends: 1570 [2019-01-11 11:15:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:15:38,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-01-11 11:15:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-01-11 11:15:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-01-11 11:15:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-01-11 11:15:43,158 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-01-11 11:15:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:43,159 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-01-11 11:15:43,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:15:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-01-11 11:15:43,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:43,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:43,162 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 11:15:43,162 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:43,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:43,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-01-11 11:15:43,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:43,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:43,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:43,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:43,163 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:15:43,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:43,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:43,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:15:43,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:15:43,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:43,234 INFO 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-01-11 11:15:43,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:15:43,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:15:43,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:15:43,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:15:43,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:43,306 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 18 treesize of output 21 [2019-01-11 11:15:43,323 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 21 treesize of output 23 [2019-01-11 11:15:43,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,328 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 23 treesize of output 33 [2019-01-11 11:15:43,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,336 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 25 treesize of output 47 [2019-01-11 11:15:43,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,345 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 27 treesize of output 62 [2019-01-11 11:15:43,346 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,400 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,413 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,449 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-01-11 11:15:43,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,466 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-01-11 11:15:43,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,502 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-01-11 11:15:43,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,547 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-01-11 11:15:43,547 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,562 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,576 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,591 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,618 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-01-11 11:15:43,618 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:15:43,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,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, 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-01-11 11:15:43,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,672 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-01-11 11:15:43,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:15:43,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,712 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-01-11 11:15:43,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:15:43,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:15:43,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-11 11:15:43,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,859 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:43,860 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-01-11 11:15:43,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:43,887 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-01-11 11:15:43,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-01-11 11:15:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:43,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-01-11 11:15:43,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:44,006 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-01-11 11:15:44,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-01-11 11:15:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:44,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:44,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:44,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:15:44,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:44,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:15:44,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:15:44,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:15:44,092 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-01-11 11:15:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:15:50,174 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-01-11 11:15:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:15:50,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:15:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:15:50,181 INFO L225 Difference]: With dead ends: 2098 [2019-01-11 11:15:50,181 INFO L226 Difference]: Without dead ends: 2091 [2019-01-11 11:15:50,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:15:50,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-01-11 11:15:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-01-11 11:15:55,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-11 11:15:55,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-01-11 11:15:55,497 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-01-11 11:15:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:15:55,498 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-01-11 11:15:55,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:15:55,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-01-11 11:15:55,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:15:55,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:15:55,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:15:55,501 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:15:55,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-01-11 11:15:55,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:15:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:55,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:15:55,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:15:55,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:15:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:55,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:55,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:15:55,578 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:15:55,579 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-11 11:15:55,579 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:15:55,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:15:55,581 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:15:55,582 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:15:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:15:55,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:15:55,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:15:55,583 INFO 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-01-11 11:15:55,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:15:55,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:15:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:15:55,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:15:55,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 18 treesize of output 21 [2019-01-11 11:15:55,609 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 21 treesize of output 23 [2019-01-11 11:15:55,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,623 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 23 treesize of output 33 [2019-01-11 11:15:55,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,631 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 25 treesize of output 47 [2019-01-11 11:15:55,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,639 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 27 treesize of output 62 [2019-01-11 11:15:55,639 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,664 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,688 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,719 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-01-11 11:15:55,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,736 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-01-11 11:15:55,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,770 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-01-11 11:15:55,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,822 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-01-11 11:15:55,822 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,836 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,851 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,867 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,895 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-01-11 11:15:55,896 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:15:55,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 11:15:55,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:55,952 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-01-11 11:15:55,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 11:15:55,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:15:55,978 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:15:55,979 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-01-11 11:15:55,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:15:56,014 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-01-11 11:15:56,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 11:15:56,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:56,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:15:56,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:15:56,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:15:56,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:15:56,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:15:56,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:15:56,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:15:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:15:56,073 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-01-11 11:16:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:01,251 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-01-11 11:16:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:16:01,251 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:16:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:01,258 INFO L225 Difference]: With dead ends: 1846 [2019-01-11 11:16:01,258 INFO L226 Difference]: Without dead ends: 1839 [2019-01-11 11:16:01,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 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-01-11 11:16:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-01-11 11:16:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-01-11 11:16:06,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-11 11:16:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-01-11 11:16:06,545 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-01-11 11:16:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:06,545 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-01-11 11:16:06,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:16:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-01-11 11:16:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:16:06,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:06,547 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:06,548 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:06,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:06,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-01-11 11:16:06,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:06,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:06,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:06,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:06,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:06,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:06,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:06,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:16:06,685 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-11 11:16:06,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:06,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:06,689 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:06,689 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:16:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:06,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:06,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:06,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:16:06,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:06,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:06,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:06,716 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 18 treesize of output 21 [2019-01-11 11:16:06,718 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 21 treesize of output 23 [2019-01-11 11:16:06,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,729 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 23 treesize of output 33 [2019-01-11 11:16:06,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,739 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 25 treesize of output 47 [2019-01-11 11:16:06,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,753 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 27 treesize of output 62 [2019-01-11 11:16:06,753 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,779 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,838 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-01-11 11:16:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,854 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-01-11 11:16:06,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,889 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-01-11 11:16:06,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:06,936 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-01-11 11:16:06,937 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,952 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,967 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:06,983 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,011 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-01-11 11:16:07,012 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:16:07,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,053 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-01-11 11:16:07,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:07,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:16:07,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-01-11 11:16:07,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-01-11 11:16:07,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,313 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 78 [2019-01-11 11:16:07,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,360 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 2 xjuncts. [2019-01-11 11:16:07,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-01-11 11:16:07,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,417 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:07,418 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 67 [2019-01-11 11:16:07,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,478 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:07,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:07,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, 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-01-11 11:16:07,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:07,538 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-01-11 11:16:07,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 11:16:11,618 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification that was a NOOP. DAG size: 51 [2019-01-11 11:16:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:11,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:11,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:11,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:16:11,717 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:11,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:16:11,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:16:11,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:16:11,717 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-01-11 11:16:13,600 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-01-11 11:16:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:18,801 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-01-11 11:16:18,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:18,802 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:16:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:18,807 INFO L225 Difference]: With dead ends: 2193 [2019-01-11 11:16:18,807 INFO L226 Difference]: Without dead ends: 2192 [2019-01-11 11:16:18,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:16:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-01-11 11:16:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-01-11 11:16:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-01-11 11:16:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-01-11 11:16:24,508 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-01-11 11:16:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:24,509 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-01-11 11:16:24,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:16:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-01-11 11:16:24,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:16:24,512 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:24,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:24,512 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:24,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:24,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-01-11 11:16:24,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:24,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:24,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:24,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:24,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:24,660 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 11:16:24,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:24,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:24,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:24,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:24,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:24,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:24,977 INFO 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-01-11 11:16:24,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:16:24,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:16:24,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:16:24,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:24,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,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, 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-01-11 11:16:25,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,047 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-01-11 11:16:25,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,088 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-01-11 11:16:25,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,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-01-11 11:16:25,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,220 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 18 treesize of output 21 [2019-01-11 11:16:25,239 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 21 treesize of output 27 [2019-01-11 11:16:25,254 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 23 treesize of output 37 [2019-01-11 11:16:25,270 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 25 treesize of output 51 [2019-01-11 11:16:25,281 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:16:25,282 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,361 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,374 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,385 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,394 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,423 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-01-11 11:16:25,424 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:16:25,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,454 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-01-11 11:16:25,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,483 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-01-11 11:16:25,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:16:25,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,516 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-01-11 11:16:25,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,549 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-01-11 11:16:25,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-11 11:16:25,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,586 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:25,587 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-01-11 11:16:25,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,621 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-01-11 11:16:25,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:16:25,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:25,681 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:25,682 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-01-11 11:16:25,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:25,715 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-01-11 11:16:25,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 11:16:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:25,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:25,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:25,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:16:25,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:25,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:16:25,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:16:25,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:25,801 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-01-11 11:16:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:33,233 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-01-11 11:16:33,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:16:33,233 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 11:16:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:33,240 INFO L225 Difference]: With dead ends: 2526 [2019-01-11 11:16:33,240 INFO L226 Difference]: Without dead ends: 2520 [2019-01-11 11:16:33,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:16:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-01-11 11:16:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-01-11 11:16:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-01-11 11:16:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-01-11 11:16:39,067 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-01-11 11:16:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:39,067 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-01-11 11:16:39,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:16:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-01-11 11:16:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:16:39,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:39,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:39,072 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-01-11 11:16:39,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:39,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:16:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:39,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:39,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:39,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:39,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:39,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:16:39,165 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-01-11 11:16:39,165 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:16:39,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:16:39,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:16:39,168 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:16:39,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:39,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:16:39,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:39,169 INFO 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-01-11 11:16:39,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:39,183 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:16:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:39,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:39,192 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 18 treesize of output 21 [2019-01-11 11:16:39,194 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 21 treesize of output 23 [2019-01-11 11:16:39,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,200 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 23 treesize of output 33 [2019-01-11 11:16:39,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,208 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 25 treesize of output 47 [2019-01-11 11:16:39,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,216 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 27 treesize of output 62 [2019-01-11 11:16:39,217 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,247 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,322 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-01-11 11:16:39,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,345 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-01-11 11:16:39,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,376 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-01-11 11:16:39,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,419 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-01-11 11:16:39,420 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,448 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,463 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,490 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-01-11 11:16:39,490 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:16:39,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,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, 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-01-11 11:16:39,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:16:39,614 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-01-11 11:16:39,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-01-11 11:16:39,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:39,719 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:39,720 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-01-11 11:16:39,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:39,751 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-01-11 11:16:39,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-01-11 11:16:39,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-01-11 11:16:39,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:39,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:39,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:39,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-01-11 11:16:39,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:39,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:16:39,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:16:39,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:16:39,812 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-01-11 11:16:45,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:45,477 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-01-11 11:16:45,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:45,477 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:16:45,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:45,484 INFO L225 Difference]: With dead ends: 1971 [2019-01-11 11:16:45,484 INFO L226 Difference]: Without dead ends: 1964 [2019-01-11 11:16:45,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:16:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-01-11 11:16:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-01-11 11:16:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-01-11 11:16:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-01-11 11:16:51,206 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-01-11 11:16:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:16:51,206 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-01-11 11:16:51,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:16:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-01-11 11:16:51,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:16:51,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:16:51,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:16:51,211 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:16:51,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:16:51,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-01-11 11:16:51,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:16:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:51,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:16:51,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:16:51,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:16:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:16:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:16:51,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:51,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:16:51,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:16:51,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:16:51,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:16:51,269 INFO 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-01-11 11:16:51,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:16:51,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:16:51,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:16:51,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:16:51,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:16:51,287 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 18 treesize of output 21 [2019-01-11 11:16:51,293 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 21 treesize of output 23 [2019-01-11 11:16:51,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,302 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 23 treesize of output 33 [2019-01-11 11:16:51,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,312 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 25 treesize of output 47 [2019-01-11 11:16:51,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,326 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 27 treesize of output 62 [2019-01-11 11:16:51,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,351 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,405 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-01-11 11:16:51,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,421 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-01-11 11:16:51,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,454 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-01-11 11:16:51,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,501 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-01-11 11:16:51,501 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,514 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,543 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,570 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-01-11 11:16:51,571 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:16:51,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,614 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-01-11 11:16:51,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,633 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-01-11 11:16:51,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:16:51,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,661 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-01-11 11:16:51,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,683 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-01-11 11:16:51,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:16:51,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:16:51,713 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:16:51,713 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-01-11 11:16:51,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:16:51,738 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-01-11 11:16:51,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:16:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:51,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:16:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:16:51,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:16:51,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:16:51,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:16:51,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:16:51,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:16:51,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:16:51,810 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-01-11 11:16:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:16:57,729 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-01-11 11:16:57,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:16:57,729 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-11 11:16:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:16:57,735 INFO L225 Difference]: With dead ends: 2036 [2019-01-11 11:16:57,735 INFO L226 Difference]: Without dead ends: 2033 [2019-01-11 11:16:57,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:16:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-01-11 11:17:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-01-11 11:17:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-01-11 11:17:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-01-11 11:17:03,580 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-01-11 11:17:03,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:03,580 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-01-11 11:17:03,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:17:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-01-11 11:17:03,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:03,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:03,583 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:03,583 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:03,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:03,584 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-01-11 11:17:03,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:03,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:03,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:03,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:03,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:03,656 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:03,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:03,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:03,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:03,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:03,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:03,657 INFO 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-01-11 11:17:03,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:17:03,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:17:03,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:17:03,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:03,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:03,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,692 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 31 treesize of output 40 [2019-01-11 11:17:03,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,724 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 27 treesize of output 42 [2019-01-11 11:17:03,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 25 [2019-01-11 11:17:03,760 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,819 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 18 treesize of output 21 [2019-01-11 11:17:03,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:17:03,832 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 23 treesize of output 37 [2019-01-11 11:17:03,834 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 25 treesize of output 51 [2019-01-11 11:17:03,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, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-11 11:17:03,840 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,857 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,882 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:03,913 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-01-11 11:17:03,913 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-01-11 11:17:03,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:03,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-01-11 11:17:03,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:17:04,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-11 11:17:04,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-01-11 11:17:04,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,105 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 6 case distinctions, treesize of input 50 treesize of output 80 [2019-01-11 11:17:04,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 11:17:04,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,278 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:04,279 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 45 treesize of output 59 [2019-01-11 11:17:04,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-01-11 11:17:04,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-01-11 11:17:04,483 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-01-11 11:17:04,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,489 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 55 treesize of output 57 [2019-01-11 11:17:04,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,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, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 11:17:04,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,666 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:04,667 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 83 [2019-01-11 11:17:04,667 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,745 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:04,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,747 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 71 [2019-01-11 11:17:04,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,811 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-01-11 11:17:04,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-01-11 11:17:04,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:04,878 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 55 [2019-01-11 11:17:04,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:04,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:04,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-01-11 11:17:04,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,041 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,042 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 67 [2019-01-11 11:17:05,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:05,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:05,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-01-11 11:17:05,117 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:05,186 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-01-11 11:17:05,187 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-01-11 11:17:05,328 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-01-11 11:17:05,330 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:05,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 11:17:05,468 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:05,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:05,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:17:05,469 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-01-11 11:17:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:14,828 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-01-11 11:17:14,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:17:14,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 11:17:14,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:14,838 INFO L225 Difference]: With dead ends: 2952 [2019-01-11 11:17:14,838 INFO L226 Difference]: Without dead ends: 2951 [2019-01-11 11:17:14,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:17:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-01-11 11:17:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-01-11 11:17:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-01-11 11:17:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-01-11 11:17:20,107 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-01-11 11:17:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:20,107 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-01-11 11:17:20,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:17:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-01-11 11:17:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:20,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:20,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:20,110 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:20,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:20,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-11 11:17:20,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:20,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:20,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:20,409 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-11 11:17:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:20,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:20,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:20,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 11:17:20,587 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-11 11:17:20,588 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:20,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:20,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:20,591 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:17:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:20,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:20,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:20,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 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-01-11 11:17:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:20,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:20,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:20,612 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-01-11 11:17:20,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,629 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-01-11 11:17:20,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,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 32 treesize of output 57 [2019-01-11 11:17:20,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,711 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-01-11 11:17:20,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,781 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 18 treesize of output 21 [2019-01-11 11:17:20,784 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 21 treesize of output 23 [2019-01-11 11:17:20,786 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 23 treesize of output 33 [2019-01-11 11:17:20,790 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 25 treesize of output 47 [2019-01-11 11:17:20,794 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 27 treesize of output 62 [2019-01-11 11:17:20,795 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,816 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,829 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,837 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:20,875 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-01-11 11:17:20,875 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:17:20,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:20,911 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-01-11 11:17:20,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:17:21,005 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-01-11 11:17:21,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-11 11:17:21,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,077 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:21,077 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 49 treesize of output 59 [2019-01-11 11:17:21,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:21,141 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-01-11 11:17:21,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:21,200 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-01-11 11:17:21,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-01-11 11:17:23,236 WARN L181 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 55 [2019-01-11 11:17:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:23,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:23,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:23,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-11 11:17:23,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:23,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:17:23,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:17:23,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-01-11 11:17:23,283 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-01-11 11:17:23,517 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-01-11 11:17:23,877 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-01-11 11:17:24,032 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2019-01-11 11:17:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:29,752 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-01-11 11:17:29,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:17:29,753 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 11:17:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:29,757 INFO L225 Difference]: With dead ends: 1903 [2019-01-11 11:17:29,758 INFO L226 Difference]: Without dead ends: 1896 [2019-01-11 11:17:29,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:17:29,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-11 11:17:35,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-01-11 11:17:35,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-01-11 11:17:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-01-11 11:17:35,560 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-01-11 11:17:35,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:35,561 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-01-11 11:17:35,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:17:35,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-01-11 11:17:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 11:17:35,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:35,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:35,564 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:35,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:35,564 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-01-11 11:17:35,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:35,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:35,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:35,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:35,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:35,900 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-01-11 11:17:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:17:35,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:35,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:35,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:17:35,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:17:35,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:35,992 INFO 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-01-11 11:17:36,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:17:36,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:17:36,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 11:17:36,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:17:36,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:36,009 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 18 treesize of output 21 [2019-01-11 11:17:36,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:17:36,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,019 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 23 treesize of output 33 [2019-01-11 11:17:36,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,027 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 25 treesize of output 47 [2019-01-11 11:17:36,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:17:36,036 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,088 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,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, 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-01-11 11:17:36,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,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, 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-01-11 11:17:36,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,181 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-01-11 11:17:36,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,228 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-01-11 11:17:36,229 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,244 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,258 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,274 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,303 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-01-11 11:17:36,303 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:17:36,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,326 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-01-11 11:17:36,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:36,354 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-01-11 11:17:36,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:17:36,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:36,382 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:36,391 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 80 [2019-01-11 11:17:36,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:17:36,484 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-01-11 11:17:36,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:76 [2019-01-11 11:17:36,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:36,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:36,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:36,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 11:17:36,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:36,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:17:36,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:17:36,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:17:36,562 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-01-11 11:17:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:42,261 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-01-11 11:17:42,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:17:42,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 11:17:42,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:42,266 INFO L225 Difference]: With dead ends: 1884 [2019-01-11 11:17:42,267 INFO L226 Difference]: Without dead ends: 1877 [2019-01-11 11:17:42,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:17:42,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-01-11 11:17:48,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-01-11 11:17:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-01-11 11:17:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-01-11 11:17:48,296 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-01-11 11:17:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:17:48,296 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-01-11 11:17:48,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:17:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-01-11 11:17:48,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:17:48,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:17:48,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:17:48,301 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:17:48,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-01-11 11:17:48,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:17:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:48,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:17:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:17:48,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:17:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:48,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:48,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:17:48,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:17:48,426 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-11 11:17:48,427 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:17:48,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:17:48,429 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:17:48,429 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:17:48,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:17:48,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:17:48,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:17:48,429 INFO 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-01-11 11:17:48,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:17:48,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:17:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:17:48,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:17:48,451 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-01-11 11:17:48,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,469 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-01-11 11:17:48,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,507 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-01-11 11:17:48,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,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, 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-01-11 11:17:48,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,629 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 18 treesize of output 21 [2019-01-11 11:17:48,632 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 21 treesize of output 23 [2019-01-11 11:17:48,635 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 23 treesize of output 33 [2019-01-11 11:17:48,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:17:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:17:48,642 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,883 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,905 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,915 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,943 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-01-11 11:17:48,944 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:17:48,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:48,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, 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-01-11 11:17:48,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:48,995 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-01-11 11:17:48,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:17:49,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17: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, 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 76 [2019-01-11 11:17:49,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:17:49,103 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-01-11 11:17:49,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-11 11:17:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:17:49,134 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:17:49,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, 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 94 [2019-01-11 11:17:49,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:17:49,246 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-01-11 11:17:49,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-11 11:17:49,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:49,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:17:49,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:17:49,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:17:49,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:17:49,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:17:49,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:17:49,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:17:49,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:17:49,355 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-01-11 11:17:58,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:17:58,460 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-01-11 11:17:58,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:17:58,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:17:58,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:17:58,468 INFO L225 Difference]: With dead ends: 2991 [2019-01-11 11:17:58,468 INFO L226 Difference]: Without dead ends: 2978 [2019-01-11 11:17:58,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:17:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-01-11 11:18:06,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-01-11 11:18:06,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-01-11 11:18:06,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-01-11 11:18:06,187 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-01-11 11:18:06,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:06,187 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-01-11 11:18:06,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:18:06,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-01-11 11:18:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:18:06,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:06,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:06,192 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:06,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-01-11 11:18:06,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:06,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:06,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:06,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:06,288 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:18:06,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:06,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:06,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:18:06,288 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-11 11:18:06,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:06,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:06,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:06,291 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 11:18:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:06,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:06,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:06,292 INFO 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-01-11 11:18:06,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:06,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:06,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:06,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,334 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-01-11 11:18:06,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,366 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-01-11 11:18:06,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,405 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-01-11 11:18:06,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,456 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-01-11 11:18:06,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,490 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,531 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 18 treesize of output 21 [2019-01-11 11:18:06,534 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 21 treesize of output 27 [2019-01-11 11:18:06,537 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 23 treesize of output 37 [2019-01-11 11:18:06,541 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 25 treesize of output 51 [2019-01-11 11:18:06,543 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:18:06,543 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,568 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,582 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,593 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,603 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,633 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 11:18:06,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,671 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-01-11 11:18:06,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,699 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-01-11 11:18:06,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:18:06,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,738 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-01-11 11:18:06,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,769 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-01-11 11:18:06,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:18:06,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,806 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:06,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 38 treesize of output 94 [2019-01-11 11:18:06,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,841 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-01-11 11:18:06,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 11:18:06,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,876 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:06,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,878 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-01-11 11:18:06,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,914 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-01-11 11:18:06,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-01-11 11:18:06,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:06,953 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:06,954 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 96 [2019-01-11 11:18:06,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:06,990 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-01-11 11:18:06,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-11 11:18:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:07,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:07,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:07,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:07,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:18:07,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:07,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:18:07,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:18:07,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:18:07,670 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-01-11 11:18:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:18,101 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-01-11 11:18:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:18:18,102 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 11:18:18,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:18,110 INFO L225 Difference]: With dead ends: 3181 [2019-01-11 11:18:18,110 INFO L226 Difference]: Without dead ends: 3179 [2019-01-11 11:18:18,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:18:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-01-11 11:18:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-01-11 11:18:25,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-11 11:18:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-01-11 11:18:25,842 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-01-11 11:18:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:25,842 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-01-11 11:18:25,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:18:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-01-11 11:18:25,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:18:25,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:25,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:25,846 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:25,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:25,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-01-11 11:18:25,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:25,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:25,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:25,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:25,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:18:25,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:18:25,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:18:25,925 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:18:25,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:18:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:18:25,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:18:25,926 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-01-11 11:18:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:33,180 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-01-11 11:18:33,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:18:33,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 11:18:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:33,186 INFO L225 Difference]: With dead ends: 2346 [2019-01-11 11:18:33,186 INFO L226 Difference]: Without dead ends: 2337 [2019-01-11 11:18:33,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:18:33,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-01-11 11:18:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-01-11 11:18:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-01-11 11:18:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-01-11 11:18:40,860 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-01-11 11:18:40,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:40,860 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-01-11 11:18:40,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:18:40,860 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-01-11 11:18:40,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:18:40,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:40,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:40,864 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:40,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-01-11 11:18:40,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:40,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:40,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:40,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:18:40,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:40,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:40,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:18:40,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:18:40,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:40,994 INFO 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-01-11 11:18:41,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:18:41,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:18:41,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:18:41,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:18:41,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:41,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,052 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-01-11 11:18:41,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,086 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-01-11 11:18:41,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,127 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-01-11 11:18:41,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,177 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-01-11 11:18:41,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,195 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,253 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 18 treesize of output 21 [2019-01-11 11:18:41,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:18:41,259 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 23 treesize of output 37 [2019-01-11 11:18:41,261 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 25 treesize of output 51 [2019-01-11 11:18:41,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, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:18:41,264 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,287 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,300 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,309 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,319 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,350 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-01-11 11:18:41,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,388 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-01-11 11:18:41,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,415 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-01-11 11:18:41,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 11:18:41,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,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, 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-01-11 11:18:41,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,486 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-01-11 11:18:41,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:18:41,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,520 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:41,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,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 97 [2019-01-11 11:18:41,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,559 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-01-11 11:18:41,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-01-11 11:18:41,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,602 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:41,602 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 96 [2019-01-11 11:18:41,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,638 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-01-11 11:18:41,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:18:41,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:41,675 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:41,676 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 96 [2019-01-11 11:18:41,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:41,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-01-11 11:18:41,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-01-11 11:18:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:41,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:42,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:42,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-11 11:18:42,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:42,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:18:42,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:18:42,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:18:42,051 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-01-11 11:18:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:50,170 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-01-11 11:18:50,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:18:50,171 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-11 11:18:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:50,178 INFO L225 Difference]: With dead ends: 2345 [2019-01-11 11:18:50,178 INFO L226 Difference]: Without dead ends: 2338 [2019-01-11 11:18:50,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:18:50,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-01-11 11:18:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-01-11 11:18:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-01-11 11:18:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-01-11 11:18:52,387 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-01-11 11:18:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:52,387 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-01-11 11:18:52,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:18:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-01-11 11:18:52,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:18:52,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:52,388 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:52,388 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:52,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-01-11 11:18:52,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:52,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:18:52,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:52,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:52,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:52,442 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:18:52,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:52,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:52,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:18:52,442 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-11 11:18:52,443 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:52,443 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:52,446 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:52,446 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 2. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:18:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:52,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:52,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:52,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:18:52,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:52,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:52,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:52,465 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 18 treesize of output 21 [2019-01-11 11:18:52,468 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 21 treesize of output 23 [2019-01-11 11:18:52,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,475 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 23 treesize of output 33 [2019-01-11 11:18:52,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,483 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 25 treesize of output 47 [2019-01-11 11:18:52,492 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:18:52,493 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,561 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 26 treesize of output 25 [2019-01-11 11:18:52,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,575 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 22 treesize of output 38 [2019-01-11 11:18:52,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,704 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-11 11:18:52,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:18:52,705 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,735 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,744 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,764 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-01-11 11:18:52,764 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:18:52,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,795 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:18:52,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-11 11:18:52,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,823 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 50 [2019-01-11 11:18:52,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-01-11 11:18:52,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,862 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-11 11:18:52,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,880 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-01-11 11:18:52,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-01-11 11:18:52,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:52,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, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-11 11:18:52,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:52,923 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-01-11 11:18:52,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-01-11 11:18:52,938 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:52,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:52,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:53,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:53,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:18:53,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:53,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:18:53,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:18:53,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:18:53,004 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-01-11 11:18:55,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:55,324 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-01-11 11:18:55,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:18:55,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:18:55,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:55,326 INFO L225 Difference]: With dead ends: 480 [2019-01-11 11:18:55,326 INFO L226 Difference]: Without dead ends: 477 [2019-01-11 11:18:55,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:18:55,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-11 11:18:56,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-01-11 11:18:56,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-01-11 11:18:56,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-01-11 11:18:56,279 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-01-11 11:18:56,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:18:56,279 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-01-11 11:18:56,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:18:56,279 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-01-11 11:18:56,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:18:56,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:18:56,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:18:56,280 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:18:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-01-11 11:18:56,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:18:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:56,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:56,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:18:56,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:18:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:56,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:18:56,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:56,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:18:56,330 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:18:56,330 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:18:56,330 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:18:56,331 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:18:56,332 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:18:56,332 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:18:56,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:18:56,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:18:56,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:18:56,335 INFO 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-01-11 11:18:56,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:18:56,343 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:18:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:18:56,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:18:56,351 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 18 treesize of output 21 [2019-01-11 11:18:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:18:56,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,361 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 23 treesize of output 33 [2019-01-11 11:18:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,369 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 25 treesize of output 47 [2019-01-11 11:18:56,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,377 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 27 treesize of output 62 [2019-01-11 11:18:56,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,426 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,459 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-01-11 11:18:56,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,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, 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-01-11 11:18:56,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,510 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-01-11 11:18:56,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,556 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-01-11 11:18:56,557 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,572 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,586 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,602 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,630 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-01-11 11:18:56,631 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:18:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,666 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-01-11 11:18:56,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,684 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-01-11 11:18:56,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:18:56,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,711 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-01-11 11:18:56,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,734 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-01-11 11:18:56,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:18:56,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:18:56,761 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:18:56,762 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 73 [2019-01-11 11:18:56,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:18:56,783 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-01-11 11:18:56,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:18:56,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-01-11 11:18:56,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:18:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:18:56,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:18:56,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:18:56,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:18:56,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:18:56,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:18:56,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:18:56,854 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-01-11 11:18:58,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:18:58,745 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-01-11 11:18:58,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:18:58,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:18:58,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:18:58,747 INFO L225 Difference]: With dead ends: 250 [2019-01-11 11:18:58,747 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 11:18:58,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:18:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 11:19:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-01-11 11:19:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-11 11:19:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-01-11 11:19:00,314 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-01-11 11:19:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:00,315 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-01-11 11:19:00,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:19:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-01-11 11:19:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:19:00,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:00,315 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:00,316 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-01-11 11:19:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:00,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:00,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:00,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:19:00,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:00,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:00,485 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:19:00,485 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-11 11:19:00,486 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:19:00,486 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:19:00,487 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:19:00,487 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:19:00,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:00,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:19:00,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:00,488 INFO 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-01-11 11:19:00,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:00,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:19:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:00,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:00,510 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 18 treesize of output 21 [2019-01-11 11:19:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:19:00,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,520 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 23 treesize of output 33 [2019-01-11 11:19:00,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,528 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 25 treesize of output 47 [2019-01-11 11:19:00,537 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-01-11 11:19:00,538 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,588 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,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 26 treesize of output 25 [2019-01-11 11:19:00,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19: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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-01-11 11:19:00,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-11 11:19:00,646 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,655 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,664 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,683 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-01-11 11:19:00,684 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-01-11 11:19:00,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,714 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:19:00,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-01-11 11:19:00,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,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, 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 50 [2019-01-11 11:19:00,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,756 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-01-11 11:19:00,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-01-11 11:19:00,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:00,778 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:00,779 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 56 [2019-01-11 11:19:00,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:00,796 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-01-11 11:19:00,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-11 11:19:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:00,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:00,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:00,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:19:00,860 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:00,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:19:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:19:00,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:19:00,861 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-01-11 11:19:04,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:04,162 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-01-11 11:19:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:19:04,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:19:04,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:04,164 INFO L225 Difference]: With dead ends: 372 [2019-01-11 11:19:04,164 INFO L226 Difference]: Without dead ends: 362 [2019-01-11 11:19:04,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:19:04,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-01-11 11:19:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-01-11 11:19:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-01-11 11:19:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-01-11 11:19:06,507 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-01-11 11:19:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:06,508 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-01-11 11:19:06,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:19:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-01-11 11:19:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:19:06,508 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:06,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:06,509 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:06,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:06,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-01-11 11:19:06,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:06,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:06,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:06,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:06,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:06,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-01-11 11:19:06,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:06,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:06,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:19:06,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:19:06,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:06,712 INFO 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-01-11 11:19:06,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:19:06,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:19:06,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:19:06,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:19:06,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:06,730 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 18 treesize of output 21 [2019-01-11 11:19:06,733 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 21 treesize of output 23 [2019-01-11 11:19:06,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,740 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 23 treesize of output 33 [2019-01-11 11:19:06,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,748 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 25 treesize of output 47 [2019-01-11 11:19:06,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,758 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 27 treesize of output 62 [2019-01-11 11:19:06,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,840 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-01-11 11:19:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,857 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-01-11 11:19:06,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,894 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-01-11 11:19:06,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:06,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, 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-01-11 11:19:06,941 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,969 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:06,985 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:07,013 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-01-11 11:19:07,013 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:19:07,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,037 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-01-11 11:19:07,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:07,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-01-11 11:19:07,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:19:07,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:07,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, 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 80 [2019-01-11 11:19:07,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:19:07,195 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-01-11 11:19:07,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-01-11 11:19:07,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:07,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, 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-01-11 11:19:07,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:07,272 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-01-11 11:19:07,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-01-11 11:19:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:07,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:07,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:07,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:19:07,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:07,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:19:07,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:19:07,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:19:07,360 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-01-11 11:19:10,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:10,327 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-01-11 11:19:10,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:19:10,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:19:10,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:10,329 INFO L225 Difference]: With dead ends: 332 [2019-01-11 11:19:10,329 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 11:19:10,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:19:10,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 11:19:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-01-11 11:19:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-01-11 11:19:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-01-11 11:19:12,755 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-01-11 11:19:12,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:12,755 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-01-11 11:19:12,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:19:12,755 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-01-11 11:19:12,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:19:12,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:12,756 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:12,756 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-01-11 11:19:12,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:12,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:12,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:19:12,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:12,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:19:12,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:12,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:12,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:19:12,832 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-11 11:19:12,833 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:19:12,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:19:12,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:19:12,835 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:19:12,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:12,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:19:12,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:12,835 INFO 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-01-11 11:19:12,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:12,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:19:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:12,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:12,860 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-01-11 11:19:12,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,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, 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-01-11 11:19:12,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,912 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-01-11 11:19:12,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:12,959 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-01-11 11:19:12,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:12,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:12,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,027 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 18 treesize of output 21 [2019-01-11 11:19:13,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:19:13,033 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 23 treesize of output 33 [2019-01-11 11:19:13,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:19:13,038 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 27 treesize of output 62 [2019-01-11 11:19:13,038 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,060 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,073 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,083 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,093 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,121 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-01-11 11:19:13,121 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:19:13,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,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-01-11 11:19:13,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,187 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-01-11 11:19:13,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:19:13,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,215 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:13,216 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-01-11 11:19:13,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,237 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-01-11 11:19:13,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:19:13,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:13,266 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:13,267 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-01-11 11:19:13,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:13,289 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-01-11 11:19:13,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:19:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:13,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:13,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:13,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:13,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 11:19:13,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:13,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:19:13,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:19:13,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:19:13,384 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-01-11 11:19:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:16,068 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-01-11 11:19:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:19:16,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-11 11:19:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:16,070 INFO L225 Difference]: With dead ends: 294 [2019-01-11 11:19:16,070 INFO L226 Difference]: Without dead ends: 287 [2019-01-11 11:19:16,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:19:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-11 11:19:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-01-11 11:19:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-11 11:19:18,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-01-11 11:19:18,497 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-01-11 11:19:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:18,498 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-01-11 11:19:18,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:19:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-01-11 11:19:18,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:19:18,498 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:18,498 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:18,499 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:18,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-01-11 11:19:18,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:18,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:18,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:18,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:18,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:19:18,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:18,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:18,599 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:19:18,599 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-11 11:19:18,600 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:19:18,600 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:19:18,602 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:19:18,602 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:19:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:18,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:19:18,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:18,602 INFO 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-01-11 11:19:18,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:18,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:19:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:18,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:18,618 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 18 treesize of output 21 [2019-01-11 11:19:18,622 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 21 treesize of output 23 [2019-01-11 11:19:18,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,629 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 23 treesize of output 33 [2019-01-11 11:19:18,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:19:18,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,645 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 27 treesize of output 62 [2019-01-11 11:19:18,645 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:18,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:18,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:18,698 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:18,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:18,730 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-01-11 11:19:18,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:18,747 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-01-11 11:19:19,152 WARN L181 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-01-11 11:19:19,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,207 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-01-11 11:19:19,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,252 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-01-11 11:19:19,253 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:19,268 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:19,282 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:19,298 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:19,326 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-01-11 11:19:19,327 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:19:19,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,360 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-01-11 11:19:19,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:19,388 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-01-11 11:19:19,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:19:19,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,432 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-01-11 11:19:19,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:19:19,536 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-01-11 11:19:19,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-01-11 11:19:19,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,618 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:19,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,620 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 41 treesize of output 69 [2019-01-11 11:19:19,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:19,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:19,682 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:19,683 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-01-11 11:19:19,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:19,734 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-01-11 11:19:19,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-01-11 11:19:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:19,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:19,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:19,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:19:19,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:19,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:19:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:19:19,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:19:19,875 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-01-11 11:19:20,409 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-01-11 11:19:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:23,591 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-01-11 11:19:23,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:19:23,591 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:19:23,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:23,593 INFO L225 Difference]: With dead ends: 364 [2019-01-11 11:19:23,593 INFO L226 Difference]: Without dead ends: 357 [2019-01-11 11:19:23,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-01-11 11:19:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-01-11 11:19:26,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-01-11 11:19:26,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-01-11 11:19:26,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-01-11 11:19:26,189 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-01-11 11:19:26,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:26,189 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-01-11 11:19:26,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:19:26,189 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-01-11 11:19:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:19:26,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:26,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:26,190 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:26,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:26,190 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-01-11 11:19:26,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:26,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:26,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:26,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:26,504 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-01-11 11:19:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:19:26,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:26,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:26,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:19:26,535 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 11:19:26,535 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:19:26,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:19:26,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:19:26,537 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:19:26,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:26,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:19:26,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:26,537 INFO 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-01-11 11:19:26,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:26,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:19:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:26,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:26,553 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 18 treesize of output 21 [2019-01-11 11:19:26,557 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 21 treesize of output 23 [2019-01-11 11:19:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,562 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 23 treesize of output 33 [2019-01-11 11:19:26,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,571 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 25 treesize of output 47 [2019-01-11 11:19:26,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,579 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 27 treesize of output 62 [2019-01-11 11:19:26,579 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,620 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,664 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-01-11 11:19:26,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,682 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-01-11 11:19:26,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,717 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-01-11 11:19:26,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,764 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-01-11 11:19:26,764 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,779 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,794 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,810 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,838 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-01-11 11:19:26,838 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:19:26,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,883 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-01-11 11:19:26,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,902 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-01-11 11:19:26,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:19:26,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,930 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-01-11 11:19:26,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:26,953 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-01-11 11:19:26,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 11:19:26,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:26,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:26,981 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-01-11 11:19:26,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:27,004 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-01-11 11:19:27,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:19:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:27,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:27,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:27,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 11:19:27,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:27,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 11:19:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 11:19:27,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:19:27,076 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-01-11 11:19:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:30,189 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-01-11 11:19:30,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:19:30,190 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-11 11:19:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:30,191 INFO L225 Difference]: With dead ends: 319 [2019-01-11 11:19:30,191 INFO L226 Difference]: Without dead ends: 312 [2019-01-11 11:19:30,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:19:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-01-11 11:19:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-01-11 11:19:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-01-11 11:19:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-01-11 11:19:33,120 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-01-11 11:19:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:33,120 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-01-11 11:19:33,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 11:19:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-01-11 11:19:33,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:19:33,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:33,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:33,121 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:33,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-01-11 11:19:33,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:33,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:33,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:33,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:33,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:19:33,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:33,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:33,262 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-11 11:19:33,262 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-11 11:19:33,263 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:19:33,263 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:19:33,265 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:19:33,265 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:19:33,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:33,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:19:33,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:33,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:19:33,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:33,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:19:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:33,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:33,281 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-01-11 11:19:33,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,298 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-01-11 11:19:33,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,337 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-01-11 11:19:33,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,386 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-01-11 11:19:33,386 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,404 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,421 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,464 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 18 treesize of output 21 [2019-01-11 11:19:33,467 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 21 treesize of output 23 [2019-01-11 11:19:33,470 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 23 treesize of output 33 [2019-01-11 11:19:33,472 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 25 treesize of output 47 [2019-01-11 11:19:33,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:19:33,476 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,497 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,510 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,520 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,530 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,558 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-01-11 11:19:33,558 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:19:33,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,607 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-01-11 11:19:33,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:19:33,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:19:33,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 11:19:33,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,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, 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 67 [2019-01-11 11:19:33,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,861 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-01-11 11:19:33,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:33,910 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 2 xjuncts. [2019-01-11 11:19:33,910 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-01-11 11:19:33,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:33,965 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:33,966 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-01-11 11:19:33,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:34,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,028 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:34,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:34,029 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 65 [2019-01-11 11:19:34,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:34,071 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-01-11 11:19:34,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 11:19:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:34,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:34,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:34,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:34,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 11:19:34,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:34,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:19:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:19:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:19:34,193 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-01-11 11:19:35,534 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-01-11 11:19:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:38,604 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-01-11 11:19:38,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:19:38,604 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-11 11:19:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:38,606 INFO L225 Difference]: With dead ends: 392 [2019-01-11 11:19:38,606 INFO L226 Difference]: Without dead ends: 386 [2019-01-11 11:19:38,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:19:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-01-11 11:19:41,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-01-11 11:19:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-01-11 11:19:41,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-01-11 11:19:41,786 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-01-11 11:19:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:41,786 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-01-11 11:19:41,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:19:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-01-11 11:19:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 11:19:41,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:41,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:41,787 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:41,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-11 11:19:41,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:41,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:41,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:41,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:19:41,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:19:41,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:19:41,863 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:19:41,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 11:19:41,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 11:19:41,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:19:41,864 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-01-11 11:19:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:44,899 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-01-11 11:19:44,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:19:44,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 11:19:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:44,901 INFO L225 Difference]: With dead ends: 320 [2019-01-11 11:19:44,901 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 11:19:44,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-11 11:19:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 11:19:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-01-11 11:19:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-01-11 11:19:48,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-01-11 11:19:48,059 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-01-11 11:19:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:19:48,059 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-01-11 11:19:48,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 11:19:48,059 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-01-11 11:19:48,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:19:48,060 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:19:48,060 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:19:48,060 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:19:48,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:19:48,060 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-01-11 11:19:48,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:19:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:48,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:19:48,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:19:48,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:19:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:19:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:19:48,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:48,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:19:48,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:19:48,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:19:48,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:19:48,144 INFO 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-01-11 11:19:48,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:19:48,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:19:48,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:19:48,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:19:48,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:19:48,162 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-01-11 11:19:48,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,178 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-01-11 11:19:48,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,211 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-01-11 11:19:48,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,259 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-01-11 11:19:48,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,286 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,324 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 18 treesize of output 21 [2019-01-11 11:19:48,328 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 21 treesize of output 23 [2019-01-11 11:19:48,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, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-01-11 11:19:48,335 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 25 treesize of output 47 [2019-01-11 11:19:48,339 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 27 treesize of output 62 [2019-01-11 11:19:48,339 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,360 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,373 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,383 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,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-01-11 11:19:48,425 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:19:48,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,452 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-01-11 11:19:48,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,478 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-01-11 11:19:48,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 11:19:48,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,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, 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-01-11 11:19:48,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,542 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-01-11 11:19:48,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-01-11 11:19:48,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,583 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-01-11 11:19:48,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:19:48,683 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-01-11 11:19:48,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-11 11:19:48,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:19:48,746 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:19:48,747 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 73 [2019-01-11 11:19:48,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:19:48,771 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-01-11 11:19:48,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 11:19:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:48,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:19:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:19:48,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:19:48,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:19:48,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:19:48,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:19:48,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:19:48,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:19:48,874 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-01-11 11:19:55,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:19:55,321 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-01-11 11:19:55,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:19:55,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:19:55,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:19:55,323 INFO L225 Difference]: With dead ends: 601 [2019-01-11 11:19:55,323 INFO L226 Difference]: Without dead ends: 591 [2019-01-11 11:19:55,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:19:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-11 11:20:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-01-11 11:20:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-01-11 11:20:00,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-01-11 11:20:00,523 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-01-11 11:20:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:20:00,523 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-01-11 11:20:00,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:20:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-01-11 11:20:00,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:20:00,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:20:00,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:20:00,525 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:20:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:00,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-01-11 11:20:00,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:20:00,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:00,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:20:00,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:00,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:20:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:20:00,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:00,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:20:00,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:20:00,606 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:20:00,607 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:20:00,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:20:00,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:20:00,610 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:20:00,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:00,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:20:00,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:00,611 INFO 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-01-11 11:20:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:00,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:20:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:00,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:20:00,628 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-01-11 11:20:00,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,646 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-01-11 11:20:00,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,687 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-01-11 11:20:00,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,735 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-01-11 11:20:00,736 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,816 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 18 treesize of output 21 [2019-01-11 11:20:00,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:20:00,822 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 23 treesize of output 33 [2019-01-11 11:20:00,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:20:00,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:20:00,829 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,851 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,863 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,873 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,882 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,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-01-11 11:20:00,910 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:20:00,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,935 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-01-11 11:20:00,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:00,962 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-01-11 11:20:00,963 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:20:00,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:00,994 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 76 [2019-01-11 11:20:00,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:01,022 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-01-11 11:20:01,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-01-11 11:20:01,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:01,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:01,062 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 93 [2019-01-11 11:20:01,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:20:01,163 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-01-11 11:20:01,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-01-11 11:20:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:01,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:20:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:01,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:20:01,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:20:01,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:20:01,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:20:01,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:20:01,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:20:01,255 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-01-11 11:20:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:20:11,331 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-01-11 11:20:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:20:11,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:20:11,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:20:11,333 INFO L225 Difference]: With dead ends: 731 [2019-01-11 11:20:11,333 INFO L226 Difference]: Without dead ends: 718 [2019-01-11 11:20:11,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:20:11,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-01-11 11:20:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-01-11 11:20:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-01-11 11:20:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-01-11 11:20:19,996 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-01-11 11:20:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:20:19,997 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-01-11 11:20:19,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:20:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-01-11 11:20:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:20:19,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:20:19,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:20:19,998 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:20:19,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-01-11 11:20:19,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:20:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:20,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:20,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:20,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:20:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:20:20,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:20,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:20:20,137 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:20:20,138 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-11 11:20:20,139 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:20:20,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:20:20,141 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:20:20,141 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:20:20,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:20,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:20:20,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:20,142 INFO 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-01-11 11:20:20,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:20,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:20:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:20,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:20:20,199 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-01-11 11:20:20,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,252 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-01-11 11:20:20,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,290 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-01-11 11:20:20,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,338 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-01-11 11:20:20,338 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,415 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 18 treesize of output 21 [2019-01-11 11:20:20,419 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 21 treesize of output 23 [2019-01-11 11:20:20,422 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 23 treesize of output 33 [2019-01-11 11:20:20,425 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 25 treesize of output 47 [2019-01-11 11:20:20,427 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 27 treesize of output 62 [2019-01-11 11:20:20,428 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,454 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,467 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,513 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-01-11 11:20:20,513 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:20:20,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,562 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-01-11 11:20:20,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-01-11 11:20:20,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,609 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 59 [2019-01-11 11:20:20,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,628 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-01-11 11:20:20,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-01-11 11:20:20,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,661 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:20,662 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-01-11 11:20:20,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,687 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-01-11 11:20:20,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-01-11 11:20:20,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:20,717 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:20,718 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 73 [2019-01-11 11:20:20,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:20,740 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-01-11 11:20:20,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-01-11 11:20:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:20,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:20:20,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:20,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:20:20,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 11:20:20,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:20:20,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:20:20,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:20:20,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:20:20,851 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-01-11 11:20:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:20:31,176 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-01-11 11:20:31,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:20:31,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:20:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:20:31,178 INFO L225 Difference]: With dead ends: 480 [2019-01-11 11:20:31,178 INFO L226 Difference]: Without dead ends: 473 [2019-01-11 11:20:31,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:20:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-01-11 11:20:34,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-01-11 11:20:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-11 11:20:34,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-01-11 11:20:34,560 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-01-11 11:20:34,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:20:34,560 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-01-11 11:20:34,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:20:34,561 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-01-11 11:20:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:20:34,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:20:34,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:20:34,562 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:20:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:34,562 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-11 11:20:34,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:20:34,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:34,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:34,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:34,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:20:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:20:34,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:34,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:20:34,698 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:20:34,698 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 11:20:34,699 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:20:34,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:20:34,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:20:34,701 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:20:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:34,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:20:34,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:34,701 INFO 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-01-11 11:20:34,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:34,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:20:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:34,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:20:34,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 18 treesize of output 21 [2019-01-11 11:20:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:20:34,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,735 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 23 treesize of output 33 [2019-01-11 11:20:34,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:20:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:20:34,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,779 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,805 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,836 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-01-11 11:20:34,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,852 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-01-11 11:20:34,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,889 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-01-11 11:20:34,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:34,934 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-01-11 11:20:34,934 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,949 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,964 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:34,980 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:35,008 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-01-11 11:20:35,008 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:20:35,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,056 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-01-11 11:20:35,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:35,072 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-01-11 11:20:35,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:20:35,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,103 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-01-11 11:20:35,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:35,126 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-01-11 11:20:35,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-01-11 11:20:35,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,152 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:35,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:35,154 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 76 [2019-01-11 11:20:35,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:35,176 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-01-11 11:20:35,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:20:35,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:35,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:20:35,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:20:35,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:20:35,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:20:35,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:20:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:20:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:20:35,247 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-01-11 11:20:40,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:20:40,692 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-01-11 11:20:40,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:20:40,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:20:40,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:20:40,694 INFO L225 Difference]: With dead ends: 258 [2019-01-11 11:20:40,694 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 11:20:40,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:20:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 11:20:45,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-01-11 11:20:45,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-01-11 11:20:45,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-01-11 11:20:45,295 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-01-11 11:20:45,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:20:45,295 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-01-11 11:20:45,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:20:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-01-11 11:20:45,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:20:45,296 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:20:45,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:20:45,296 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:20:45,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:45,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-01-11 11:20:45,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:20:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:45,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:45,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:20:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:20:45,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:45,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:20:45,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:20:45,454 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-11 11:20:45,455 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:20:45,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:20:45,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:20:45,457 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:20:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:45,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:20:45,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:45,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 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-01-11 11:20:45,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:45,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:20:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:45,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:20:45,476 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 18 treesize of output 21 [2019-01-11 11:20:45,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:20:45,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,506 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 23 treesize of output 33 [2019-01-11 11:20:45,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,513 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 25 treesize of output 47 [2019-01-11 11:20:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,522 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 27 treesize of output 62 [2019-01-11 11:20:45,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,606 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-01-11 11:20:45,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,623 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-01-11 11:20:45,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,660 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-01-11 11:20:45,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,703 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-01-11 11:20:45,704 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,724 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,754 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,782 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-11 11:20:45,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,821 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-01-11 11:20:45,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:45,848 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-01-11 11:20:45,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-11 11:20:45,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:45,884 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:45,893 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 80 [2019-01-11 11:20:45,894 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:20:45,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:20:45,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-01-11 11:20:46,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,037 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:46,038 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 39 treesize of output 53 [2019-01-11 11:20:46,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:46,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,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 52 treesize of output 90 [2019-01-11 11:20:46,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:46,151 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 2 xjuncts. [2019-01-11 11:20:46,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-01-11 11:20:46,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,218 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:46,219 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 102 [2019-01-11 11:20:46,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:46,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:46,302 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:20:46,303 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 63 [2019-01-11 11:20:46,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:46,346 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-01-11 11:20:46,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-01-11 11:20:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:46,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:20:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:46,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:20:46,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:20:46,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:20:46,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:20:46,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:20:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:20:46,458 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-01-11 11:20:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:20:52,826 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-01-11 11:20:52,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:20:52,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:20:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:20:52,827 INFO L225 Difference]: With dead ends: 295 [2019-01-11 11:20:52,827 INFO L226 Difference]: Without dead ends: 284 [2019-01-11 11:20:52,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:20:52,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-11 11:20:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-01-11 11:20:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 11:20:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-01-11 11:20:57,669 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-01-11 11:20:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:20:57,670 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-01-11 11:20:57,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:20:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-01-11 11:20:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:20:57,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:20:57,670 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:20:57,670 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:20:57,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-11 11:20:57,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:20:57,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:57,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:57,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:20:57,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:20:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 11:20:57,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:57,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:20:57,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:20:57,763 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-11 11:20:57,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:20:57,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:20:57,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:20:57,765 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:20:57,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:20:57,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:20:57,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:20:57,766 INFO 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-01-11 11:20:57,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:20:57,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:20:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:20:57,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:20:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:20:57,788 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 21 treesize of output 23 [2019-01-11 11:20:57,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,794 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 23 treesize of output 33 [2019-01-11 11:20:57,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,802 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 25 treesize of output 47 [2019-01-11 11:20:57,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,811 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 27 treesize of output 62 [2019-01-11 11:20:57,811 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:57,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:57,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:57,859 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:57,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:57,890 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-01-11 11:20:57,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,907 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-01-11 11:20:57,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,943 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-01-11 11:20:57,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:57,994 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-01-11 11:20:57,994 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:58,008 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:58,030 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:58,046 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:20:58,070 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-01-11 11:20:58,071 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-01-11 11:20:58,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,089 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-01-11 11:20:58,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:58,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-01-11 11:20:58,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 11:20:58,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,146 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-01-11 11:20:58,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:20:58,242 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-01-11 11:20:58,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 11:20:58,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:20:58,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 11:20:58,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:20:58,313 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-01-11 11:20:58,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-01-11 11:20:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:58,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:20:58,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:20:58,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:20:58,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:20:58,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:20:58,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:20:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:20:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:20:58,373 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-01-11 11:21:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:21:05,543 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-01-11 11:21:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:21:05,543 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:21:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:21:05,544 INFO L225 Difference]: With dead ends: 328 [2019-01-11 11:21:05,544 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 11:21:05,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:21:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 11:21:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-01-11 11:21:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-01-11 11:21:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-01-11 11:21:12,430 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-01-11 11:21:12,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:21:12,430 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-01-11 11:21:12,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:21:12,430 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-01-11 11:21:12,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:21:12,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:21:12,430 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:21:12,431 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:21:12,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:12,431 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-11 11:21:12,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:21:12,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:12,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:12,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:12,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:21:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:12,582 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-11 11:21:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:21:12,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:12,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:21:12,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:21:12,647 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-11 11:21:12,647 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:21:12,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:21:12,649 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:21:12,649 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:21:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:12,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:21:12,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:12,649 INFO 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-01-11 11:21:12,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:12,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:21:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:12,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:21:12,857 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-11 11:21:12,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:12,895 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-01-11 11:21:12,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:12,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:12,942 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-01-11 11:21:12,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:12,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:12,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:12,984 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-01-11 11:21:13,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,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-01-11 11:21:13,032 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,119 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 18 treesize of output 21 [2019-01-11 11:21:13,121 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 21 treesize of output 27 [2019-01-11 11:21:13,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, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-11 11:21:13,126 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 25 treesize of output 51 [2019-01-11 11:21:13,129 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:21:13,129 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,152 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,166 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,218 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-01-11 11:21:13,218 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:21:13,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,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-01-11 11:21:13,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,282 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-01-11 11:21:13,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:21:13,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,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 36 treesize of output 78 [2019-01-11 11:21:13,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,348 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-01-11 11:21:13,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 11:21:13,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:13,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:13,385 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-01-11 11:21:13,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:13,421 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-01-11 11:21:13,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 11:21:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:21:13,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:21:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:21:13,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:21:13,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 11:21:13,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:21:13,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:21:13,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:21:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:21:13,505 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-01-11 11:21:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:21:23,251 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-01-11 11:21:23,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:21:23,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-11 11:21:23,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:21:23,253 INFO L225 Difference]: With dead ends: 326 [2019-01-11 11:21:23,253 INFO L226 Difference]: Without dead ends: 313 [2019-01-11 11:21:23,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:21:23,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-01-11 11:21:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-01-11 11:21:31,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-01-11 11:21:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-01-11 11:21:31,740 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-01-11 11:21:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:21:31,740 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-01-11 11:21:31,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:21:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-01-11 11:21:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:21:31,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:21:31,741 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:21:31,741 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:21:31,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:31,741 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-01-11 11:21:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:21:31,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:31,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:31,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:31,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:21:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:21:31,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:31,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:21:31,846 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:21:31,846 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 11:21:31,847 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:21:31,847 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:21:31,848 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:21:31,848 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:21:31,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:31,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:21:31,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:31,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:21:31,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:31,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:21:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:31,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:21:31,902 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 18 treesize of output 21 [2019-01-11 11:21:31,940 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 21 treesize of output 23 [2019-01-11 11:21:32,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,029 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 23 treesize of output 33 [2019-01-11 11:21:32,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,134 INFO L303 Elim1Store]: Index analysis took 103 ms [2019-01-11 11:21:32,135 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 25 treesize of output 47 [2019-01-11 11:21:32,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,263 INFO L303 Elim1Store]: Index analysis took 127 ms [2019-01-11 11:21:32,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:21:32,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,297 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,357 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-01-11 11:21:32,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,375 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-01-11 11:21:32,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,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, 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-01-11 11:21:32,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,455 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-01-11 11:21:32,456 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,469 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,484 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,500 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,528 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-01-11 11:21:32,528 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:21:32,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,560 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-01-11 11:21:32,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:21:32,653 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-01-11 11:21:32,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 11:21:32,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,701 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:32,702 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 58 [2019-01-11 11:21:32,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,722 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-01-11 11:21:32,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-01-11 11:21:32,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,747 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-01-11 11:21:32,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,766 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-01-11 11:21:32,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 11:21:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:32,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-01-11 11:21:32,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:32,827 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-01-11 11:21:32,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-01-11 11:21:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:21:32,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:21:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:21:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:21:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:21:32,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:21:32,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:21:32,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:21:32,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:21:32,911 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-01-11 11:21:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:21:44,683 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-01-11 11:21:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:21:44,684 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:21:44,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:21:44,685 INFO L225 Difference]: With dead ends: 400 [2019-01-11 11:21:44,685 INFO L226 Difference]: Without dead ends: 393 [2019-01-11 11:21:44,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:21:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-11 11:21:55,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-01-11 11:21:55,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-11 11:21:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-01-11 11:21:55,343 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-01-11 11:21:55,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:21:55,343 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-01-11 11:21:55,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:21:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-01-11 11:21:55,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:21:55,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:21:55,344 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:21:55,345 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:21:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-01-11 11:21:55,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:21:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:55,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:55,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:21:55,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:21:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:55,499 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-01-11 11:21:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:21:55,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:55,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:21:55,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:21:55,558 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-01-11 11:21:55,559 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:21:55,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:21:55,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:21:55,561 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 11:21:55,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:21:55,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:21:55,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:21:55,562 INFO 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-01-11 11:21:55,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:21:55,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:21:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:21:55,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:21:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:21:55,586 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 21 treesize of output 23 [2019-01-11 11:21:55,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,591 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 23 treesize of output 33 [2019-01-11 11:21:55,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,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 25 treesize of output 47 [2019-01-11 11:21:55,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,626 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 27 treesize of output 62 [2019-01-11 11:21:55,627 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,713 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-01-11 11:21:55,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,729 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-01-11 11:21:55,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,761 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-01-11 11:21:55,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,807 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-01-11 11:21:55,807 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,823 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,837 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,853 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:21:55,882 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-01-11 11:21:55,882 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-01-11 11:21:55,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:55,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 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:21:55,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:21:56,009 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-01-11 11:21:56,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-01-11 11:21:56,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,072 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:56,073 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 49 treesize of output 62 [2019-01-11 11:21:56,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:56,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,135 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:56,136 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 62 treesize of output 79 [2019-01-11 11:21:56,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:56,182 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 2 xjuncts. [2019-01-11 11:21:56,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-01-11 11:21:56,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,229 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 56 treesize of output 82 [2019-01-11 11:21:56,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:56,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,287 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:21:56,288 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 65 [2019-01-11 11:21:56,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:56,329 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 2 xjuncts. [2019-01-11 11:21:56,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-01-11 11:21:56,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,386 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 102 [2019-01-11 11:21:56,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:56,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:21:56,455 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 71 [2019-01-11 11:21:56,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:21:56,499 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-01-11 11:21:56,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-11 11:21:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:21:56,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:21:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:21:56,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:21:56,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 11:21:56,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:21:56,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:21:56,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:21:56,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:21:56,619 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-01-11 11:22:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:22:09,479 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-01-11 11:22:09,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:22:09,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-11 11:22:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:22:09,481 INFO L225 Difference]: With dead ends: 441 [2019-01-11 11:22:09,481 INFO L226 Difference]: Without dead ends: 428 [2019-01-11 11:22:09,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:22:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-01-11 11:22:20,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-01-11 11:22:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 11:22:20,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-01-11 11:22:20,194 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-01-11 11:22:20,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:22:20,194 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-01-11 11:22:20,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:22:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-01-11 11:22:20,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:22:20,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:22:20,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:22:20,195 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:22:20,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:22:20,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-01-11 11:22:20,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:22:20,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:20,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:22:20,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:20,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:22:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:22:20,447 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-01-11 11:22:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-11 11:22:20,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:20,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:22:20,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:22:20,531 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-11 11:22:20,532 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:22:20,532 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:22:20,533 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:22:20,533 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:22:20,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:22:20,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:22:20,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:20,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 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-01-11 11:22:20,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:22:20,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:22:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:22:20,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:22:20,551 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 18 treesize of output 21 [2019-01-11 11:22:20,553 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 21 treesize of output 23 [2019-01-11 11:22:20,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,560 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 23 treesize of output 33 [2019-01-11 11:22:20,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,568 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 25 treesize of output 47 [2019-01-11 11:22:20,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,577 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 27 treesize of output 62 [2019-01-11 11:22:20,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,603 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,628 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,659 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-01-11 11:22:20,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,677 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-01-11 11:22:20,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,711 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-01-11 11:22:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,757 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-01-11 11:22:20,758 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,773 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,803 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:20,831 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-01-11 11:22:20,831 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:22:20,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:20,870 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-01-11 11:22:20,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:22:20,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:22:20,964 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 11:22:21,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,056 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 49 treesize of output 67 [2019-01-11 11:22:21,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:21,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,120 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 96 [2019-01-11 11:22:21,121 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:21,171 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 2 xjuncts. [2019-01-11 11:22:21,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-01-11 11:22:21,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,223 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:21,224 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 99 [2019-01-11 11:22:21,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:21,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:21,289 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 78 [2019-01-11 11:22:21,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:21,330 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 2 xjuncts. [2019-01-11 11:22:21,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-01-11 11:22:21,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,383 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:21,384 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 39 treesize of output 83 [2019-01-11 11:22:21,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:21,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:21,447 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:21,447 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 48 treesize of output 106 [2019-01-11 11:22:21,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:21,500 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-01-11 11:22:21,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-01-11 11:22:21,544 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:22:21,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:22:21,604 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:22:21,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:22:21,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:22:21,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:22:21,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:22:21,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:22:21,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:22:21,623 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-01-11 11:22:29,587 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-01-11 11:22:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:22:42,834 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-01-11 11:22:42,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:22:42,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-11 11:22:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:22:42,836 INFO L225 Difference]: With dead ends: 685 [2019-01-11 11:22:42,836 INFO L226 Difference]: Without dead ends: 677 [2019-01-11 11:22:42,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:22:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-01-11 11:22:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-01-11 11:22:58,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-01-11 11:22:58,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-01-11 11:22:58,867 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-01-11 11:22:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:22:58,867 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-01-11 11:22:58,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:22:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-01-11 11:22:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:22:58,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:22:58,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:22:58,868 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:22:58,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:22:58,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-01-11 11:22:58,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:22:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:58,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:22:58,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:22:58,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:22:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:22:59,080 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-11 11:22:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:22:59,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:59,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:22:59,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:22:59,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:22:59,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:22:59,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-11 11:22:59,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:22:59,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:22:59,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:22:59,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:22:59,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:22:59,193 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-01-11 11:22:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,216 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-01-11 11:22:59,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,252 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-01-11 11:22:59,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,300 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-01-11 11:22:59,300 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,327 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,365 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 18 treesize of output 21 [2019-01-11 11:22:59,368 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 21 treesize of output 23 [2019-01-11 11:22:59,370 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 23 treesize of output 33 [2019-01-11 11:22:59,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, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-01-11 11:22:59,376 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 27 treesize of output 62 [2019-01-11 11:22:59,376 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,397 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,410 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,420 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,458 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-01-11 11:22:59,458 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:22:59,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,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 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 11:22:59,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:22:59,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:22:59,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-01-11 11:22:59,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,694 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-01-11 11:22:59,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:59,759 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 45 treesize of output 51 [2019-01-11 11:22:59,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,807 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 2 xjuncts. [2019-01-11 11:22:59,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-01-11 11:22:59,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,878 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:22:59,879 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 99 [2019-01-11 11:22:59,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:22:59,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 55 treesize of output 45 [2019-01-11 11:22:59,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:22:59,985 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 2 xjuncts. [2019-01-11 11:22:59,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-01-11 11:23:00,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,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, 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 59 [2019-01-11 11:23:00,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:00,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:00,100 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:00,100 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 48 treesize of output 110 [2019-01-11 11:23:00,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:00,152 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-01-11 11:23:00,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-01-11 11:23:00,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:00,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:23:00,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:00,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:23:00,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:23:00,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:23:00,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:23:00,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:23:00,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:23:00,294 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-01-11 11:23:00,952 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-11 11:23:01,824 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-01-11 11:23:16,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:23:16,038 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-01-11 11:23:16,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:23:16,039 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-11 11:23:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:23:16,040 INFO L225 Difference]: With dead ends: 550 [2019-01-11 11:23:16,040 INFO L226 Difference]: Without dead ends: 543 [2019-01-11 11:23:16,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:23:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-01-11 11:23:19,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-01-11 11:23:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:23:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-11 11:23:19,189 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-01-11 11:23:19,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:23:19,189 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-11 11:23:19,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:23:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-11 11:23:19,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:23:19,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:23:19,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:23:19,190 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:23:19,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:19,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-01-11 11:23:19,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:23:19,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:19,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:23:19,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:19,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:23:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:23:19,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:19,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:23:19,271 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:23:19,271 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:23:19,272 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:23:19,272 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:23:19,273 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:23:19,274 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:23:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:19,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:23:19,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:19,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 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-01-11 11:23:19,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:19,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:23:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:19,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:23:19,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,315 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-01-11 11:23:19,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,347 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-01-11 11:23:19,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,387 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-01-11 11:23:19,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:19,438 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-01-11 11:23:19,438 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:19,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:19,472 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:19,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:19,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:23:19,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-11 11:23:19,516 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 23 treesize of output 37 [2019-01-11 11:23:19,533 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 25 treesize of output 51 [2019-01-11 11:23:19,549 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-11 11:23:19,550 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:19,920 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:20,131 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:20,276 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:20,416 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:20,808 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-01-11 11:23:20,809 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-01-11 11:23:21,192 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-11 11:23:21,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,229 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-01-11 11:23:21,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:21,301 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-01-11 11:23:21,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 11:23:21,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,336 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-01-11 11:23:21,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:21,368 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-01-11 11:23:21,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 11:23:21,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,404 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:21,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,406 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-01-11 11:23:21,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:21,442 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-01-11 11:23:21,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 11:23:21,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:21,484 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:21,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, 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 96 [2019-01-11 11:23:21,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:21,518 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-01-11 11:23:21,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-11 11:23:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:22,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:23:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:22,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:23:22,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 11:23:22,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:23:22,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:23:22,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:23:22,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:23:22,120 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-11 11:23:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:23:28,251 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-01-11 11:23:28,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:23:28,252 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 11:23:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:23:28,252 INFO L225 Difference]: With dead ends: 67 [2019-01-11 11:23:28,252 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:23:28,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-01-11 11:23:28,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:23:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-01-11 11:23:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 11:23:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-01-11 11:23:31,662 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-01-11 11:23:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:23:31,662 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-01-11 11:23:31,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:23:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-01-11 11:23:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:23:31,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:23:31,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:23:31,662 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:23:31,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:31,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-01-11 11:23:31,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:23:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:31,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:31,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:23:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 11:23:31,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:31,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:23:31,800 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:23:31,800 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-11 11:23:31,800 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:23:31,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:23:31,805 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:23:31,806 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:23:31,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:31,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:23:31,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:31,806 INFO 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-01-11 11:23:31,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:31,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:23:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:31,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:23:31,825 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-01-11 11:23:31,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,842 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-01-11 11:23:31,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,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-01-11 11:23:31,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:31,927 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-01-11 11:23:31,927 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:31,943 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:31,957 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:31,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:31,995 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 18 treesize of output 21 [2019-01-11 11:23:31,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, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-11 11:23:32,001 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 23 treesize of output 33 [2019-01-11 11:23:32,004 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 25 treesize of output 47 [2019-01-11 11:23:32,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-01-11 11:23:32,008 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,029 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,042 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,090 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-01-11 11:23:32,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,129 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-01-11 11:23:32,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,156 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-01-11 11:23:32,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-01-11 11:23:32,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,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, 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-01-11 11:23:32,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:23:32,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-01-11 11:23:32,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-01-11 11:23:32,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,363 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:32,364 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 83 [2019-01-11 11:23:32,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:32,430 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 104 [2019-01-11 11:23:32,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,482 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 2 xjuncts. [2019-01-11 11:23:32,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-01-11 11:23:32,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,564 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:32,565 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 109 [2019-01-11 11:23:32,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:32,633 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:32,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, 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-01-11 11:23:32,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:32,677 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-01-11 11:23:32,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-01-11 11:23:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:32,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:23:32,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:32,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:23:32,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 11:23:32,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:23:32,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:23:32,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:23:32,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-01-11 11:23:32,819 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-01-11 11:23:39,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:23:39,363 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-01-11 11:23:39,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:23:39,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-01-11 11:23:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:23:39,364 INFO L225 Difference]: With dead ends: 74 [2019-01-11 11:23:39,364 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 11:23:39,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:23:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 11:23:43,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-01-11 11:23:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:23:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-01-11 11:23:43,079 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-01-11 11:23:43,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:23:43,080 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-01-11 11:23:43,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:23:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-01-11 11:23:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 11:23:43,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:23:43,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:23:43,080 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:23:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:43,080 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-01-11 11:23:43,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:23:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:43,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:43,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:43,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:23:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 11:23:43,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:43,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:23:43,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-11 11:23:43,225 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-01-11 11:23:43,226 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:23:43,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:23:43,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:23:43,227 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 11:23:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:43,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:23:43,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:43,228 INFO 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-01-11 11:23:43,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:43,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:23:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:43,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:23:43,249 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-01-11 11:23:43,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,264 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-01-11 11:23:43,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,302 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-01-11 11:23:43,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,350 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-01-11 11:23:43,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-11 11:23:43,421 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 21 treesize of output 23 [2019-01-11 11:23:43,424 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 23 treesize of output 33 [2019-01-11 11:23:43,428 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 25 treesize of output 47 [2019-01-11 11:23:43,433 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 27 treesize of output 62 [2019-01-11 11:23:43,433 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,454 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,467 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,487 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,515 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-01-11 11:23:43,516 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-01-11 11:23:43,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,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, 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-01-11 11:23:43,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,584 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-01-11 11:23:43,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 11:23:43,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,614 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-01-11 11:23:43,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,639 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-01-11 11:23:43,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 11:23:43,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,668 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:43,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,670 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 76 [2019-01-11 11:23:43,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,693 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-01-11 11:23:43,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-01-11 11:23:43,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:43,726 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:43,727 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-01-11 11:23:43,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:43,754 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-01-11 11:23:43,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 11:23:43,778 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:43,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:23:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:43,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:23:43,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 11:23:43,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:23:43,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:23:43,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:23:43,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:23:43,905 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-01-11 11:23:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:23:51,399 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-01-11 11:23:51,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:23:51,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-11 11:23:51,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:23:51,400 INFO L225 Difference]: With dead ends: 80 [2019-01-11 11:23:51,400 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 11:23:51,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:23:51,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 11:23:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-01-11 11:23:58,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-11 11:23:58,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-01-11 11:23:58,115 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-01-11 11:23:58,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:23:58,115 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-01-11 11:23:58,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:23:58,115 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-01-11 11:23:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 11:23:58,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:23:58,116 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:23:58,116 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:23:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:23:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-01-11 11:23:58,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:23:58,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:58,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:23:58,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:23:58,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:23:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:23:58,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-11 11:23:58,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:58,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:23:58,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:23:58,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:23:58,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:23:58,229 INFO 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-01-11 11:23:58,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:23:58,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:23:58,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:23:58,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:23:58,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:23:58,251 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 18 treesize of output 21 [2019-01-11 11:23:58,253 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 21 treesize of output 23 [2019-01-11 11:23:58,261 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 23 treesize of output 25 [2019-01-11 11:23:58,270 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 25 treesize of output 27 [2019-01-11 11:23:58,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-01-11 11:23:58,284 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,301 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,310 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,346 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 17 treesize of output 20 [2019-01-11 11:23:58,349 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 20 treesize of output 22 [2019-01-11 11:23:58,357 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 22 treesize of output 24 [2019-01-11 11:23:58,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-01-11 11:23:58,376 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,384 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,391 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,399 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,415 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-01-11 11:23:58,416 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-01-11 11:23:58,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 11:23:58,453 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 11:23:58,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 11:23:58,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-01-11 11:23:58,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-01-11 11:23:58,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-01-11 11:23:58,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-11 11:23:58,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-01-11 11:23:58,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,606 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-01-11 11:23:58,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 11:23:58,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,661 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 2 xjuncts. [2019-01-11 11:23:58,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-01-11 11:23:58,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 11:23:58,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,720 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-01-11 11:23:58,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,744 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 2 xjuncts. [2019-01-11 11:23:58,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-01-11 11:23:58,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,779 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 11:23:58,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,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, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-01-11 11:23:58,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 11:23:58,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-01-11 11:23:58,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 11:23:58,832 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 2 xjuncts. [2019-01-11 11:23:58,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-01-11 11:23:58,866 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:58,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:23:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:23:58,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:23:58,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 11:23:58,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:23:58,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 11:23:58,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 11:23:58,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:23:58,949 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-01-11 11:24:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:24:06,087 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-01-11 11:24:06,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:24:06,087 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-01-11 11:24:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:24:06,087 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:24:06,088 INFO L226 Difference]: Without dead ends: 0 [2019-01-11 11:24:06,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:24:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-11 11:24:06,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-11 11:24:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-11 11:24:06,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-11 11:24:06,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-01-11 11:24:06,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:24:06,089 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-11 11:24:06,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 11:24:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-11 11:24:06,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-11 11:24:06,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-11 11:24:06,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:06,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:06,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:06,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:06,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:07,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:07,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:07,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:08,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:08,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:27,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:31,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:40,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:40,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:50,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:24:51,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-11 11:25:14,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent.