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-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:06:36,886 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:06:36,888 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:06:36,904 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:06:36,904 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:06:36,906 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:06:36,907 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:06:36,910 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:06:36,913 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:06:36,914 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:06:36,915 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:06:36,916 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:06:36,917 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:06:36,919 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:06:36,926 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:06:36,928 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:06:36,929 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:06:36,931 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:06:36,933 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:06:36,937 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:06:36,938 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:06:36,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:06:36,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:06:36,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:06:36,943 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:06:36,944 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:06:36,945 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:06:36,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:06:36,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:06:36,950 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:06:36,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:06:36,951 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:06:36,951 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:06:36,951 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:06:36,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:06:36,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:06:36,955 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-31 17:06:36,974 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:06:36,974 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:06:36,975 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:06:36,975 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:06:36,975 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:06:36,975 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:06:36,976 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:06:36,976 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:06:36,976 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-31 17:06:36,976 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:06:36,976 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-31 17:06:36,977 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-31 17:06:36,977 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:06:36,977 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:06:36,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:06:36,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:06:36,978 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:06:36,978 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:06:36,978 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:06:36,979 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:06:36,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:06:36,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:06:36,979 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:06:36,979 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:06:36,979 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:06:36,980 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:06:36,980 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:06:36,980 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:06:36,980 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:06:36,980 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:06:36,981 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:06:36,981 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:36,981 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:06:36,981 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:06:36,981 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:06:36,981 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:06:36,982 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:06:36,982 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:06:36,982 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:06:36,982 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:06:37,016 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:06:37,030 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:06:37,034 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:06:37,035 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:06:37,036 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:06:37,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-31 17:06:37,037 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-31 17:06:37,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:06:37,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:06:37,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:37,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:06:37,073 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:06:37,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:06:37,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:06:37,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:06:37,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:06:37,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,147 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/1) ... [2019-01-31 17:06:37,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:06:37,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:06:37,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:06:37,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:06:37,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:06:37,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:06:37,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:06:37,558 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:06:37,559 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-31 17:06:37,560 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:37 BoogieIcfgContainer [2019-01-31 17:06:37,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:06:37,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:06:37,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:06:37,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:06:37,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:06:37" (1/2) ... [2019-01-31 17:06:37,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4174576a and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:06:37, skipping insertion in model container [2019-01-31 17:06:37,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:06:37" (2/2) ... [2019-01-31 17:06:37,568 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-31 17:06:37,578 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:06:37,586 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-31 17:06:37,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-31 17:06:37,643 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:06:37,643 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:06:37,643 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:06:37,643 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:06:37,643 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:06:37,644 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:06:37,644 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:06:37,644 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:06:37,661 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-31 17:06:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:06:37,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:37,678 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:06:37,683 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:37,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:37,693 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-31 17:06:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:37,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:37,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:37,879 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-31 17:06:37,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:37,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:37,882 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:37,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:37,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:37,898 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-31 17:06:38,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:38,158 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-31 17:06:38,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:38,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:06:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:38,173 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:06:38,174 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:06:38,177 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-31 17:06:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:06:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-31 17:06:38,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:06:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-31 17:06:38,215 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-31 17:06:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:38,216 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-31 17:06:38,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-31 17:06:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:38,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:38,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:38,218 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:38,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-31 17:06:38,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:38,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:38,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:38,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:38,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:38,482 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-31 17:06:38,527 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-31 17:06:38,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:38,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:38,528 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:38,530 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-31 17:06:38,579 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:38,579 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:38,641 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:38,642 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:38,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:38,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:38,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:38,648 INFO 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-31 17:06:38,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:38,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:38,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:38,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-31 17:06:38,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,745 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-31 17:06:38,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,788 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-31 17:06:38,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,806 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-31 17:06:38,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:38,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, 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-31 17:06:38,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,134 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,230 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,386 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-31 17:06:39,389 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:39,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:39,519 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-31 17:06:39,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:39,595 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-31 17:06:39,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:39,677 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-31 17:06:39,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:39,771 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-31 17:06:39,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:39,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:39,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:39,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:39,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:39,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:39,793 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-31 17:06:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:40,494 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-31 17:06:40,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:40,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:40,497 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:06:40,497 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:06:40,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:06:40,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-31 17:06:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:06:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-31 17:06:40,504 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-31 17:06:40,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:40,504 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-31 17:06:40,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-31 17:06:40,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:40,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:40,505 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:40,506 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:40,506 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-31 17:06:40,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:40,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:40,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:40,591 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-31 17:06:40,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:40,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:40,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:40,592 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-31 17:06:40,594 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:40,594 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:40,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:40,612 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:40,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:40,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:40,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 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-31 17:06:40,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:40,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:40,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:40,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:40,643 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-31 17:06:40,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:06:40,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,759 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-31 17:06:40,760 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-31 17:06:40,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,783 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-31 17:06:40,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:40,807 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-31 17:06:40,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,884 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,904 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,917 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:40,965 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-31 17:06:40,965 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:40,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,016 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-31 17:06:41,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,085 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-31 17:06:41,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:41,119 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-31 17:06:41,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:41,133 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-31 17:06:41,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:41,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:06:41,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:41,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:41,153 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-31 17:06:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:41,230 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-31 17:06:41,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:41,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:06:41,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:41,234 INFO L225 Difference]: With dead ends: 18 [2019-01-31 17:06:41,234 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:06:41,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:06:41,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 17:06:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:06:41,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-31 17:06:41,239 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-31 17:06:41,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:41,239 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-31 17:06:41,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:41,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-31 17:06:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:41,240 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:41,240 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:41,240 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:41,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,241 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-31 17:06:41,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:41,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,242 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,277 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-31 17:06:41,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:41,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:41,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:41,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:41,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:41,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:41,279 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-31 17:06:41,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:41,331 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-31 17:06:41,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:41,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:06:41,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:41,332 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:06:41,332 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:06:41,332 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-31 17:06:41,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:06:41,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-31 17:06:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:06:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-31 17:06:41,338 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-31 17:06:41,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:41,343 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-31 17:06:41,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:41,343 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-31 17:06:41,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:06:41,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:41,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:06:41,344 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,344 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-31 17:06:41,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:41,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:41,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:41,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:41,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,466 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-31 17:06:41,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:41,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:41,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:06:41,467 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-31 17:06:41,469 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:41,470 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:41,477 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:41,478 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:41,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:41,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:41,479 INFO 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-31 17:06:41,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:41,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:41,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:41,502 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-31 17:06:41,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,510 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-31 17:06:41,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,525 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-31 17:06:41,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:06:41,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,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, 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-31 17:06:41,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,722 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-31 17:06:41,722 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:41,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:41,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:41,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:41,825 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-31 17:06:41,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:41,869 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-31 17:06:41,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:41,883 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-31 17:06:41,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:41,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:41,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:41,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:41,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:41,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:41,910 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-31 17:06:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:42,153 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-31 17:06:42,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:42,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-31 17:06:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:42,155 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:06:42,156 INFO L226 Difference]: Without dead ends: 38 [2019-01-31 17:06:42,157 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-31 17:06:42,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-31 17:06:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-31 17:06:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:06:42,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-31 17:06:42,163 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-31 17:06:42,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:42,164 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-31 17:06:42,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:42,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-31 17:06:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:42,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:42,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:42,165 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-31 17:06:42,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:42,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:42,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:42,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,295 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-31 17:06:42,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:42,296 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:42,296 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-31 17:06:42,301 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:42,301 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:42,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:42,308 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:42,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:42,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:42,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:42,309 INFO 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-31 17:06:42,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:42,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:42,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:42,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:06:42,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,355 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-31 17:06:42,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,365 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-31 17:06:42,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,389 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-31 17:06:42,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,404 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-31 17:06:42,405 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,517 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,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-31 17:06:42,559 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:42,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,639 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-31 17:06:42,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,687 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-31 17:06:42,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:42,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:42,741 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-31 17:06:42,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:42,885 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-31 17:06:42,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:06:42,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-31 17:06:42,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:42,950 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-31 17:06:42,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:42,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:42,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:42,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:42,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:42,969 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-31 17:06:43,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:43,523 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-01-31 17:06:43,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:43,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:43,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:43,525 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:06:43,525 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:06:43,526 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-31 17:06:43,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:06:43,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-01-31 17:06:43,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-31 17:06:43,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-31 17:06:43,532 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-31 17:06:43,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:43,532 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-31 17:06:43,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-31 17:06:43,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:43,533 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:43,533 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:43,533 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-01-31 17:06:43,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:43,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:43,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:43,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:43,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:43,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:43,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:43,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:43,667 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:43,667 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-31 17:06:43,669 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:43,669 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:43,675 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:43,675 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:43,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:43,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:43,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:43,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:43,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:43,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:43,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:43,700 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-31 17:06:43,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,704 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-31 17:06:43,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:06:43,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,730 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-31 17:06:43,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,744 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-31 17:06:43,745 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,772 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,833 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-31 17:06:43,834 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:43,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:43,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, 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-31 17:06:43,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:43,993 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-31 17:06:43,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:44,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:44,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, 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-31 17:06:44,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:44,141 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-31 17:06:44,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:06:44,196 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-31 17:06:44,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:44,221 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-31 17:06:44,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:44,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:44,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:44,240 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-31 17:06:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:45,061 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-01-31 17:06:45,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:45,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:45,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:45,062 INFO L225 Difference]: With dead ends: 47 [2019-01-31 17:06:45,062 INFO L226 Difference]: Without dead ends: 46 [2019-01-31 17:06:45,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:45,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-31 17:06:45,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-01-31 17:06:45,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:06:45,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-01-31 17:06:45,070 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-01-31 17:06:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:45,070 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-01-31 17:06:45,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:45,070 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-01-31 17:06:45,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:45,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:45,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:45,071 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:45,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,071 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-31 17:06:45,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:45,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:45,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,149 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-31 17:06:45,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:45,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:45,149 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-31 17:06:45,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:45,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:45,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:45,160 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:45,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:45,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,161 INFO 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-31 17:06:45,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:45,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:45,180 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-31 17:06:45,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:06:45,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:06:45,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,217 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:06:45,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,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, 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-31 17:06:45,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,259 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,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-31 17:06:45,310 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:06:45,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,352 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-31 17:06:45,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,383 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-31 17:06:45,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:45,399 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-31 17:06:45,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:45,415 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-31 17:06:45,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:06:45,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:06:45,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:45,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:06:45,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:06:45,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:45,434 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-01-31 17:06:45,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:45,484 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-01-31 17:06:45,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:45,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:06:45,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:45,485 INFO L225 Difference]: With dead ends: 28 [2019-01-31 17:06:45,485 INFO L226 Difference]: Without dead ends: 27 [2019-01-31 17:06:45,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-31 17:06:45,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-31 17:06:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:06:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-01-31 17:06:45,493 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-01-31 17:06:45,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:45,493 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-01-31 17:06:45,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:06:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-01-31 17:06:45,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:45,494 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:45,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:45,495 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:45,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,495 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-31 17:06:45,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:45,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,673 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-31 17:06:45,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:45,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:45,674 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-31 17:06:45,675 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:45,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:45,682 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:45,682 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:45,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:45,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:45,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:45,683 INFO 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-31 17:06:45,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:45,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:45,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:45,709 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-31 17:06:45,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,716 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-31 17:06:45,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,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, 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-31 17:06:45,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,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, 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-31 17:06:45,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,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, 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-31 17:06:45,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,833 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,865 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-31 17:06:45,865 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:45,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,903 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-31 17:06:45,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:45,944 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-31 17:06:45,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:45,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:45,998 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:45,999 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-31 17:06:46,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,046 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-31 17:06:46,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:06:46,071 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-31 17:06:46,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:46,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:46,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:46,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:46,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:46,122 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-01-31 17:06:46,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:46,546 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-01-31 17:06:46,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:46,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:46,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:46,548 INFO L225 Difference]: With dead ends: 44 [2019-01-31 17:06:46,548 INFO L226 Difference]: Without dead ends: 43 [2019-01-31 17:06:46,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:46,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-31 17:06:46,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-01-31 17:06:46,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-31 17:06:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-01-31 17:06:46,555 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-01-31 17:06:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:46,555 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-01-31 17:06:46,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-01-31 17:06:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:46,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:46,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:46,556 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:46,556 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-31 17:06:46,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:46,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:46,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:46,558 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:46,620 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-31 17:06:46,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:46,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:46,621 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:46,621 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-31 17:06:46,623 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:46,623 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:46,628 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:46,628 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:46,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:46,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:46,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:46,629 INFO 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-31 17:06:46,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:46,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:46,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:46,660 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-31 17:06:46,701 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-31 17:06:46,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:06:46,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,752 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:06:46,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,765 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-31 17:06:46,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,836 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-31 17:06:46,837 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:06:46,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:46,872 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-31 17:06:46,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:46,897 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-31 17:06:46,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:46,911 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-31 17:06:46,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:46,923 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-31 17:06:46,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:46,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:46,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:46,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:46,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:46,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:46,942 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-01-31 17:06:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:47,178 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-01-31 17:06:47,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:47,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:47,180 INFO L225 Difference]: With dead ends: 43 [2019-01-31 17:06:47,180 INFO L226 Difference]: Without dead ends: 42 [2019-01-31 17:06:47,181 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-31 17:06:47,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-31 17:06:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-01-31 17:06:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-31 17:06:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-01-31 17:06:47,188 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-01-31 17:06:47,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:47,188 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-01-31 17:06:47,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-01-31 17:06:47,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:47,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:47,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:47,189 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:47,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:47,189 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-31 17:06:47,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:47,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:47,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:47,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:47,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-31 17:06:47,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:47,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:47,379 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:47,379 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-31 17:06:47,381 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:47,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:47,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:47,386 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:47,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:47,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:47,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:47,387 INFO 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-31 17:06:47,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:47,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:47,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:47,429 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-31 17:06:47,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,437 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-31 17:06:47,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,456 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-31 17:06:47,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,477 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-31 17:06:47,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,501 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-31 17:06:47,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,553 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,613 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-31 17:06:47,614 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,649 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-31 17:06:47,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,696 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-31 17:06:47,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:47,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:47,741 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-31 17:06:47,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:47,790 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-31 17:06:47,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:47,816 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-31 17:06:47,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:47,840 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-31 17:06:47,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:47,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:47,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:47,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:47,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:47,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:47,860 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-01-31 17:06:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:48,277 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-01-31 17:06:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:48,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:48,278 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:06:48,278 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:06:48,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:06:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-01-31 17:06:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 17:06:48,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-31 17:06:48,288 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-31 17:06:48,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:48,288 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-31 17:06:48,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:48,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-31 17:06:48,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:48,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:48,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:48,289 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:48,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:48,290 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-01-31 17:06:48,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:48,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:48,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:48,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:48,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:48,427 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-31 17:06:48,447 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-31 17:06:48,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:48,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:48,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:06:48,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:06:48,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:48,449 INFO 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-31 17:06:48,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:06:48,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:06:48,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:06:48,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:06:48,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:48,468 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-31 17:06:48,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,478 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-31 17:06:48,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:06:48,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,499 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-31 17:06:48,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,514 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-31 17:06:48,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,540 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,553 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,602 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-31 17:06:48,602 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:48,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,638 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-31 17:06:48,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,782 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-31 17:06:48,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:48,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:48,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:48,868 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-31 17:06:48,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:48,903 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-31 17:06:48,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:48,964 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-31 17:06:48,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:48,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:48,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:48,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:48,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:48,984 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-01-31 17:06:49,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:49,356 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-01-31 17:06:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:49,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:49,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:49,358 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:06:49,358 INFO L226 Difference]: Without dead ends: 64 [2019-01-31 17:06:49,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-31 17:06:49,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-31 17:06:49,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-31 17:06:49,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-01-31 17:06:49,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-01-31 17:06:49,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:49,368 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-01-31 17:06:49,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-01-31 17:06:49,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:49,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:49,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:49,369 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:49,369 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-31 17:06:49,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:49,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:49,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:06:49,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:49,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:49,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:49,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:49,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:49,435 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:49,435 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-01-31 17:06:49,437 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:49,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:49,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:49,442 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:49,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:49,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:49,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:49,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:49,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:49,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:49,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:49,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:06:49,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,484 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-31 17:06:49,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,494 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-31 17:06:49,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:06:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,516 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-31 17:06:49,516 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,544 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,572 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,607 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-31 17:06:49,608 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:49,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:49,646 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-31 17:06:49,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:49,690 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-31 17:06:49,691 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:49,708 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-31 17:06:49,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:49,720 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-31 17:06:49,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:49,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:49,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:49,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:49,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:49,741 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-01-31 17:06:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:49,926 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-01-31 17:06:49,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:49,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:49,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:49,927 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:06:49,927 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:06:49,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-31 17:06:49,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:06:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-31 17:06:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-31 17:06:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-01-31 17:06:49,936 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-01-31 17:06:49,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:49,936 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-01-31 17:06:49,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:49,936 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-01-31 17:06:49,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:49,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:49,937 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:49,937 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:49,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:49,937 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-01-31 17:06:49,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:49,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:49,991 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-31 17:06:49,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:06:49,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:06:49,992 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:06:49,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:06:49,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:06:49,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:06:49,992 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-01-31 17:06:50,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:50,029 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-01-31 17:06:50,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:06:50,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:06:50,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:50,029 INFO L225 Difference]: With dead ends: 34 [2019-01-31 17:06:50,030 INFO L226 Difference]: Without dead ends: 31 [2019-01-31 17:06:50,030 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-31 17:06:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-31 17:06:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-31 17:06:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:06:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-01-31 17:06:50,038 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-01-31 17:06:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:50,038 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-01-31 17:06:50,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:06:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-01-31 17:06:50,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:50,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:50,039 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:50,039 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:50,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:50,040 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-31 17:06:50,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:50,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:50,147 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-31 17:06:50,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:50,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:50,148 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:50,148 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-31 17:06:50,150 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:50,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:50,155 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:50,155 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:50,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:50,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:50,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:50,156 INFO 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-31 17:06:50,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:50,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:50,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:50,177 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-31 17:06:50,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,183 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-31 17:06:50,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,192 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-31 17:06:50,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,220 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-31 17:06:50,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,232 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-31 17:06:50,233 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,301 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,349 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-31 17:06:50,350 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:50,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:50,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,440 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-31 17:06:50,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:50,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:50,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:50,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:50,527 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-31 17:06:50,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:06:50,549 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-31 17:06:50,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:50,564 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-31 17:06:50,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:50,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:06:50,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:50,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:50,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:50,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:06:50,583 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-01-31 17:06:50,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:50,940 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-01-31 17:06:50,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:50,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:50,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:50,941 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:06:50,941 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:06:50,942 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-31 17:06:50,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:06:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-01-31 17:06:50,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-31 17:06:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-01-31 17:06:50,950 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-01-31 17:06:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:50,951 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-01-31 17:06:50,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-01-31 17:06:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:50,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:50,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:50,952 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:50,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-31 17:06:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:50,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:51,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:51,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:51,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:51,025 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:51,025 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-31 17:06:51,028 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:51,028 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:51,033 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:51,033 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:51,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:51,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:51,033 INFO 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-31 17:06:51,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:51,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:51,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:51,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:06:51,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:06:51,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:06:51,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:06:51,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,095 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-31 17:06:51,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,131 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,168 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-31 17:06:51,169 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:06:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:51,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 51 [2019-01-31 17:06:51,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:51,234 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-31 17:06:51,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:51,249 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-31 17:06:51,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:51,269 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-31 17:06:51,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:51,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:51,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:51,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:51,289 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-01-31 17:06:51,754 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-31 17:06:52,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:52,074 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-01-31 17:06:52,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:52,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-31 17:06:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:52,075 INFO L225 Difference]: With dead ends: 51 [2019-01-31 17:06:52,075 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 17:06:52,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 17:06:52,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-31 17:06:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:06:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-01-31 17:06:52,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-01-31 17:06:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:52,087 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-01-31 17:06:52,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-01-31 17:06:52,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:06:52,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:52,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:06:52,088 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:52,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:52,088 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-31 17:06:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:52,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:52,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:52,205 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-31 17:06:52,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:52,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:52,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:06:52,206 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-31 17:06:52,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:52,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:52,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:52,212 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:52,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:52,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:52,213 INFO 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-31 17:06:52,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:52,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:52,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:52,234 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-31 17:06:52,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,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, 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-31 17:06:52,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,250 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-31 17:06:52,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,276 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-31 17:06:52,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,284 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-31 17:06:52,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,312 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,369 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-31 17:06:52,369 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:52,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:52,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,473 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-31 17:06:52,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:52,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:52,544 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-31 17:06:52,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:52,996 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-31 17:06:52,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:53,027 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-31 17:06:53,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:53,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:53,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:53,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:53,069 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-01-31 17:06:53,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:53,587 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-01-31 17:06:53,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:53,587 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-31 17:06:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:53,588 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:06:53,588 INFO L226 Difference]: Without dead ends: 63 [2019-01-31 17:06:53,589 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-31 17:06:53,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-31 17:06:53,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-01-31 17:06:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:06:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-31 17:06:53,599 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-01-31 17:06:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:53,599 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-31 17:06:53,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-31 17:06:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:53,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:53,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:53,601 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:53,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-31 17:06:53,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:53,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:53,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:53,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:53,679 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-31 17:06:53,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:53,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:53,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:53,680 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-31 17:06:53,681 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:53,681 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:53,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:53,685 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:53,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:53,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:53,686 INFO 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-31 17:06:53,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:53,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:53,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:53,708 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-31 17:06:53,710 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-31 17:06:53,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:06:53,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,730 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:06:53,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,744 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-31 17:06:53,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,767 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,789 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,815 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-31 17:06:53,816 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:06:53,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,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 45 [2019-01-31 17:06:53,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,915 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-31 17:06:53,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:53,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:53,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, 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-31 17:06:53,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:53,972 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-31 17:06:53,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:53,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:54,009 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-31 17:06:54,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:54,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:54,028 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:54,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:54,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:54,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:54,029 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-31 17:06:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:54,374 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-01-31 17:06:54,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:54,375 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:54,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:54,376 INFO L225 Difference]: With dead ends: 57 [2019-01-31 17:06:54,376 INFO L226 Difference]: Without dead ends: 56 [2019-01-31 17:06:54,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:54,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-31 17:06:54,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-31 17:06:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:06:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-01-31 17:06:54,385 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-01-31 17:06:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:54,385 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-01-31 17:06:54,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-01-31 17:06:54,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:54,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:54,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:54,387 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:54,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,387 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-31 17:06:54,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:54,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:54,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:54,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,542 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-31 17:06:54,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:54,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:54,543 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:54,543 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-31 17:06:54,544 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:54,544 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:54,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:54,548 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:06:54,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:54,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:54,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:54,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:54,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:54,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:54,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:54,604 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-31 17:06:54,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,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, 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-31 17:06:54,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,614 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-31 17:06:54,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,693 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-31 17:06:54,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:54,805 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-31 17:06:54,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:06:54,807 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,954 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:54,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,011 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-31 17:06:55,011 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:55,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,070 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-31 17:06:55,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,129 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-31 17:06:55,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:55,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:55,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,254 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-31 17:06:55,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:06:55,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,319 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:55,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:55,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, 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-31 17:06:55,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:55,386 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-31 17:06:55,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:06:55,441 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-31 17:06:55,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:55,480 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-31 17:06:55,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:55,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:06:55,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:55,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:55,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:55,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:06:55,499 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-01-31 17:06:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:56,537 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-01-31 17:06:56,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:06:56,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:56,539 INFO L225 Difference]: With dead ends: 68 [2019-01-31 17:06:56,539 INFO L226 Difference]: Without dead ends: 67 [2019-01-31 17:06:56,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:06:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-31 17:06:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-31 17:06:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:06:56,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-31 17:06:56,554 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-31 17:06:56,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:56,554 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-31 17:06:56,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-31 17:06:56,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:56,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:56,555 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:56,557 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-31 17:06:56,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:56,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:56,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,891 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-31 17:06:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:56,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:56,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:56,920 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-31 17:06:56,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:56,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:56,927 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:56,927 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:56,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:56,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:56,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 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-31 17:06:56,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:56,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:56,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:56,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-31 17:06:56,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,955 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-31 17:06:56,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:06:56,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:56,976 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-31 17:06:57,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,068 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-31 17:06:57,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,095 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,111 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,123 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,152 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-31 17:06:57,153 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:57,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:57,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,229 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-31 17:06:57,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:57,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,264 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-31 17:06:57,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,319 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-31 17:06:57,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:06:57,344 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:06:57,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:57,370 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-31 17:06:57,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:57,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:57,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:57,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:57,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:57,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:57,390 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-31 17:06:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:57,768 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-01-31 17:06:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:06:57,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:06:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:57,770 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:06:57,770 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:06:57,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 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-31 17:06:57,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:06:57,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-01-31 17:06:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-31 17:06:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-31 17:06:57,781 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-31 17:06:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:57,781 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-31 17:06:57,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:06:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-31 17:06:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:57,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:57,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:57,782 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-01-31 17:06:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:57,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:57,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:57,821 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-31 17:06:57,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:57,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:57,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:57,822 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-31 17:06:57,823 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:57,823 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:57,828 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:57,828 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:06:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:57,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:57,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:57,829 INFO 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-31 17:06:57,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:57,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:57,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:57,845 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-31 17:06:57,852 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-31 17:06:57,859 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-31 17:06:57,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:06:57,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:06:57,891 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,903 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,948 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-31 17:06:57,948 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-31 17:06:57,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:57,980 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-31 17:06:57,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:57,996 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-31 17:06:57,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:06:58,010 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-31 17:06:58,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:58,020 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-31 17:06:58,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:58,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:06:58,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:58,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:06:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:06:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:06:58,039 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-01-31 17:06:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:58,164 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-01-31 17:06:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:06:58,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 17:06:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:58,166 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:06:58,166 INFO L226 Difference]: Without dead ends: 44 [2019-01-31 17:06:58,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:06:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-31 17:06:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-31 17:06:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-31 17:06:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-01-31 17:06:58,177 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-01-31 17:06:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:58,177 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-01-31 17:06:58,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:06:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-01-31 17:06:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:58,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:58,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:58,178 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:58,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,179 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-01-31 17:06:58,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:58,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:58,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,263 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-31 17:06:58,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:58,264 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:58,264 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-01-31 17:06:58,264 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:58,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:58,267 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:58,268 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:06:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:58,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:58,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:58,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:06:58,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:58,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:58,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:58,290 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-31 17:06:58,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,296 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-31 17:06:58,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,306 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-31 17:06:58,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,314 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-31 17:06:58,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,325 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-31 17:06:58,326 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,385 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,414 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-31 17:06:58,415 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:06:58,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,456 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-31 17:06:58,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,495 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-31 17:06:58,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:06:58,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,529 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:06:58,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:06:58,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,574 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-31 17:06:58,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:06:58,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:58,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 40 treesize of output 90 [2019-01-31 17:06:58,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:58,736 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-31 17:06:58,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:06:58,754 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-31 17:06:58,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:58,799 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-31 17:06:58,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:58,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:06:58,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:58,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:06:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:06:58,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:06:58,819 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-01-31 17:06:59,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:06:59,414 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-01-31 17:06:59,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:06:59,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:06:59,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:06:59,419 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:06:59,419 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 17:06:59,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:06:59,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 17:06:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-31 17:06:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-31 17:06:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-01-31 17:06:59,430 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-01-31 17:06:59,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:06:59,431 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-01-31 17:06:59,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:06:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-01-31 17:06:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:06:59,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:06:59,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:06:59,432 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:06:59,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,433 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-31 17:06:59,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:06:59,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:06:59,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:06:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,570 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-31 17:06:59,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:06:59,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:06:59,570 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-31 17:06:59,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:06:59,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:06:59,575 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:06:59,575 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:06:59,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:06:59,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:06:59,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:06:59,576 INFO 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-31 17:06:59,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:06:59,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:06:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:06:59,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:06:59,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 18 treesize of output 21 [2019-01-31 17:06:59,616 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-31 17:06:59,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:06:59,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:06:59,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,653 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-31 17:06:59,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,720 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-31 17:06:59,721 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:06:59,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,765 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-31 17:06:59,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,793 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-31 17:06:59,793 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:06:59,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:06:59,854 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-31 17:06:59,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:06:59,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:06:59,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:06:59,956 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-31 17:06:59,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:06:59,978 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-31 17:06:59,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:06:59,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:06:59,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:06:59,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:06:59,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:06:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:06:59,998 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-01-31 17:07:00,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:00,329 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-01-31 17:07:00,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:00,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:00,330 INFO L225 Difference]: With dead ends: 59 [2019-01-31 17:07:00,330 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:07:00,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:07:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-01-31 17:07:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:07:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-31 17:07:00,340 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-31 17:07:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:00,341 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-31 17:07:00,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-31 17:07:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:00,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:00,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:00,342 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:00,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:00,342 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-31 17:07:00,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:00,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:00,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:00,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:00,692 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-31 17:07:00,720 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-31 17:07:00,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:00,720 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:00,720 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:00,720 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-31 17:07:00,721 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:00,721 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:00,725 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:00,725 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:00,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:00,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:00,727 INFO 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-31 17:07:00,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:00,735 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:00,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:00,747 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-31 17:07:00,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,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-31 17:07:00,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,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-31 17:07:00,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,777 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-31 17:07:00,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,789 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-31 17:07:00,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,817 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,874 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-31 17:07:00,875 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:00,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:00,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:00,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:00,972 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-31 17:07:00,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:01,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,035 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-31 17:07:01,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,082 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-31 17:07:01,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:01,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,200 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:01,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:01,202 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-31 17:07:01,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:01,277 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-31 17:07:01,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:01,309 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-31 17:07:01,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:01,348 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-31 17:07:01,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:01,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:01,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:01,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:01,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:01,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:01,367 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-31 17:07:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:02,129 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-01-31 17:07:02,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:02,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:02,130 INFO L225 Difference]: With dead ends: 71 [2019-01-31 17:07:02,131 INFO L226 Difference]: Without dead ends: 70 [2019-01-31 17:07:02,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:02,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-31 17:07:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-31 17:07:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:07:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-01-31 17:07:02,148 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-01-31 17:07:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:02,149 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-01-31 17:07:02,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-01-31 17:07:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:02,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:02,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:02,149 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:02,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-31 17:07:02,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:02,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:02,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,683 WARN L181 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 17:07:02,757 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-31 17:07:02,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:02,758 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:02,758 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-31 17:07:02,759 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:02,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:02,762 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:02,762 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:02,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:02,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:02,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:02,763 INFO 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-31 17:07:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:02,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:02,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:02,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:02,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:07:02,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:02,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,799 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-31 17:07:02,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,808 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-31 17:07:02,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,852 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,891 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-31 17:07:02,892 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:02,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:02,926 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-31 17:07:02,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:02,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-31 17:07:02,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:03,175 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-31 17:07:03,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:03,476 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:03,476 INFO L303 Elim1Store]: Index analysis took 297 ms [2019-01-31 17:07:03,477 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-31 17:07:03,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:03,978 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-31 17:07:03,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:04,175 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-31 17:07:04,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:04,279 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-31 17:07:04,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:04,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:04,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:04,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:04,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:04,299 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-01-31 17:07:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:04,637 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-01-31 17:07:04,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:04,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:04,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:04,638 INFO L225 Difference]: With dead ends: 66 [2019-01-31 17:07:04,639 INFO L226 Difference]: Without dead ends: 65 [2019-01-31 17:07:04,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:04,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-31 17:07:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-01-31 17:07:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-31 17:07:04,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-31 17:07:04,651 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-31 17:07:04,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:04,651 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-31 17:07:04,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:04,652 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-31 17:07:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:04,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:04,652 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:04,652 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-01-31 17:07:04,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:04,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:04,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:04,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:04,821 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:04,821 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-01-31 17:07:04,822 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:04,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:04,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:04,825 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:04,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:04,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:04,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:04,826 INFO 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-31 17:07:04,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:04,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:04,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:04,863 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-31 17:07:04,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,868 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-31 17:07:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,872 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-31 17:07:04,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,884 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-31 17:07:04,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:04,891 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-31 17:07:04,891 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,920 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,935 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:04,976 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-31 17:07:04,976 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:05,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,013 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-31 17:07:05,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,057 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-31 17:07:05,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,092 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:05,093 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-31 17:07:05,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,136 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-31 17:07:05,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:05,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:05,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-31 17:07:05,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:05,234 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-31 17:07:05,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:05,258 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-31 17:07:05,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:05,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:05,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:05,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:05,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:05,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:05,383 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-31 17:07:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:06,106 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-01-31 17:07:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:06,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:06,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:06,108 INFO L225 Difference]: With dead ends: 93 [2019-01-31 17:07:06,108 INFO L226 Difference]: Without dead ends: 92 [2019-01-31 17:07:06,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-31 17:07:06,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-31 17:07:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-31 17:07:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-01-31 17:07:06,121 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-01-31 17:07:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:06,121 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-01-31 17:07:06,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-01-31 17:07:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:06,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:06,122 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:06,122 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:06,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,122 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-31 17:07:06,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,339 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-31 17:07:06,411 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-31 17:07:06,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:06,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:06,412 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-31 17:07:06,413 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:06,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:06,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:06,416 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:06,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,417 INFO 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-31 17:07:06,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:06,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-31 17:07:06,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-31 17:07:06,567 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-31 17:07:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:07:06,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:07:06,599 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,615 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,660 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-31 17:07:06,660 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-31 17:07:06,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,690 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-31 17:07:06,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:06,707 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-31 17:07:06,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:06,720 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-31 17:07:06,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:06,766 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-31 17:07:06,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:06,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:07:06,787 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:06,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:06,787 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-01-31 17:07:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:06,834 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-01-31 17:07:06,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:06,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-31 17:07:06,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:06,836 INFO L225 Difference]: With dead ends: 56 [2019-01-31 17:07:06,836 INFO L226 Difference]: Without dead ends: 55 [2019-01-31 17:07:06,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:06,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-31 17:07:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-31 17:07:06,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 17:07:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-01-31 17:07:06,850 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-01-31 17:07:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:06,850 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-01-31 17:07:06,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-01-31 17:07:06,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:06,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:06,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:06,851 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:06,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,851 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-01-31 17:07:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:06,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,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-31 17:07:06,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:06,914 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:06,914 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-31 17:07:06,915 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:06,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:06,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:06,918 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:06,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:06,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:06,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 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-31 17:07:06,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:06,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:06,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:06,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:06,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 18 treesize of output 21 [2019-01-31 17:07:06,942 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-31 17:07:06,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:06,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,973 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:06,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:06,988 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-31 17:07:06,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,013 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:07,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:07:07,064 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:07,970 WARN L181 SmtUtils]: Spent 901.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-31 17:07:07,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:07,983 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-31 17:07:07,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,037 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-31 17:07:08,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:08,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,067 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-31 17:07:08,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,100 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-31 17:07:08,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:08,114 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-31 17:07:08,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:08,132 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-31 17:07:08,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:08,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:08,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:08,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:08,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:08,152 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-01-31 17:07:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:08,531 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-01-31 17:07:08,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:08,532 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:08,533 INFO L225 Difference]: With dead ends: 85 [2019-01-31 17:07:08,533 INFO L226 Difference]: Without dead ends: 84 [2019-01-31 17:07:08,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-31 17:07:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-01-31 17:07:08,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 17:07:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-01-31 17:07:08,551 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-01-31 17:07:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:08,551 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-01-31 17:07:08,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-01-31 17:07:08,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:08,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:08,552 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:08,552 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:08,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,552 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-01-31 17:07:08,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:08,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:08,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,707 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-31 17:07:08,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:08,708 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:08,709 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-01-31 17:07:08,710 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:08,710 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:08,713 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:08,713 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:08,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:08,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:08,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:08,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:08,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:08,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:08,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:08,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:08,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,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, 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-31 17:07:08,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,749 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-31 17:07:08,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,760 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-31 17:07:08,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,809 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-31 17:07:08,809 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,841 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,867 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,897 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-31 17:07:08,898 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:08,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:08,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, 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-31 17:07:08,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:08,979 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-31 17:07:08,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:09,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,021 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-31 17:07:09,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,096 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-31 17:07:09,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:09,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:09,147 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:09,148 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-31 17:07:09,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:09,249 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-31 17:07:09,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:09,282 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-31 17:07:09,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:09,324 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-31 17:07:09,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:09,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:09,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:09,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:09,344 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-01-31 17:07:10,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:10,178 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-01-31 17:07:10,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:10,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:10,180 INFO L225 Difference]: With dead ends: 96 [2019-01-31 17:07:10,180 INFO L226 Difference]: Without dead ends: 94 [2019-01-31 17:07:10,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-31 17:07:10,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-01-31 17:07:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:07:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-31 17:07:10,196 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-31 17:07:10,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:10,197 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-31 17:07:10,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-31 17:07:10,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:10,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:10,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:10,197 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:10,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,198 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-31 17:07:10,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:10,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:10,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:10,326 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-31 17:07:10,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:10,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:10,330 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:10,331 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:10,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:10,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:10,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:10,331 INFO 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-31 17:07:10,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:10,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:10,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:10,348 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-31 17:07:10,351 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-31 17:07:10,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:10,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,387 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:10,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,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, 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-31 17:07:10,406 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,499 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-31 17:07:10,500 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:10,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,575 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-31 17:07:10,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,609 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-31 17:07:10,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:10,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:10,665 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:10,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:10,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:10,702 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-31 17:07:10,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:10,724 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-31 17:07:10,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:10,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:10,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:10,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:10,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:10,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:10,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:10,811 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-31 17:07:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:11,120 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-01-31 17:07:11,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:11,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:11,122 INFO L225 Difference]: With dead ends: 82 [2019-01-31 17:07:11,122 INFO L226 Difference]: Without dead ends: 81 [2019-01-31 17:07:11,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:11,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-31 17:07:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-01-31 17:07:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-31 17:07:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-31 17:07:11,142 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-31 17:07:11,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:11,142 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-31 17:07:11,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:11,142 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-31 17:07:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:11,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:11,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:11,143 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-31 17:07:11,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:11,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:11,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,244 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-31 17:07:11,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:11,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:11,245 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-31 17:07:11,246 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:11,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:11,251 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:11,252 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:11,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:11,252 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:11,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:11,252 INFO 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-31 17:07:11,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:11,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:11,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:11,271 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-31 17:07:11,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,278 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-31 17:07:11,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,340 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-31 17:07:11,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,423 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-31 17:07:11,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,462 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-31 17:07:11,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,491 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,507 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,519 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,548 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-31 17:07:11,548 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:11,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:11,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,620 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-31 17:07:11,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:11,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:11,786 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-31 17:07:11,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:11,836 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-31 17:07:11,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:11,854 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-31 17:07:11,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:11,865 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-31 17:07:11,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:11,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:11,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:11,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:11,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:11,886 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-31 17:07:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:12,331 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-01-31 17:07:12,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:12,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:12,333 INFO L225 Difference]: With dead ends: 87 [2019-01-31 17:07:12,333 INFO L226 Difference]: Without dead ends: 86 [2019-01-31 17:07:12,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:12,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-31 17:07:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-01-31 17:07:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-31 17:07:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-01-31 17:07:12,352 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-01-31 17:07:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:12,353 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-01-31 17:07:12,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-01-31 17:07:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:12,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:12,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:12,354 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-31 17:07:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:12,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:12,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,454 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-31 17:07:12,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:12,454 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:12,455 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-31 17:07:12,456 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:12,456 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:12,458 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:12,458 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:12,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:12,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:12,460 INFO 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-31 17:07:12,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:12,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:12,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:12,479 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-31 17:07:12,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,483 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-31 17:07:12,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,492 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-31 17:07:12,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,497 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-31 17:07:12,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,506 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-31 17:07:12,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,534 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,622 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-31 17:07:12,622 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:12,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:12,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,697 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-31 17:07:12,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:12,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:12,731 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:12,732 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-31 17:07:12,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:12,778 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-31 17:07:12,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:12,798 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-31 17:07:12,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:12,820 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-31 17:07:12,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:12,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:12,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:12,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:12,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:12,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:12,840 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-01-31 17:07:13,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:13,175 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-01-31 17:07:13,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:13,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:13,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:13,177 INFO L225 Difference]: With dead ends: 86 [2019-01-31 17:07:13,177 INFO L226 Difference]: Without dead ends: 85 [2019-01-31 17:07:13,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:13,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-31 17:07:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-31 17:07:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-31 17:07:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-01-31 17:07:13,198 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-01-31 17:07:13,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:13,198 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-01-31 17:07:13,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-01-31 17:07:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:13,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:13,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:13,199 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:13,199 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-01-31 17:07:13,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:13,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:13,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:13,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:13,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:13,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:13,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:13,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:13,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:13,289 INFO 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-31 17:07:13,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:13,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:13,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:07:13,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:13,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:13,305 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-31 17:07:13,309 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-31 17:07:13,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:13,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,337 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:13,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,350 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-31 17:07:13,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,393 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,423 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-31 17:07:13,423 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:13,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:13,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,484 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-31 17:07:13,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:13,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:13,512 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-31 17:07:13,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:13,543 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-31 17:07:13,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:13,558 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-31 17:07:13,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:13,603 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-31 17:07:13,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:13,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:13,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:13,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:13,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:13,623 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-01-31 17:07:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:14,387 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-01-31 17:07:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:14,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:14,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:14,389 INFO L225 Difference]: With dead ends: 110 [2019-01-31 17:07:14,389 INFO L226 Difference]: Without dead ends: 107 [2019-01-31 17:07:14,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:14,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-31 17:07:14,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-01-31 17:07:14,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:07:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-01-31 17:07:14,419 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-01-31 17:07:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:14,419 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-01-31 17:07:14,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-01-31 17:07:14,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:14,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:14,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:14,420 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-31 17:07:14,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:14,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:14,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,560 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-31 17:07:14,569 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-31 17:07:14,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:14,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:14,570 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-01-31 17:07:14,571 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:14,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:14,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:14,574 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:14,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:14,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:14,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:14,575 INFO 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-31 17:07:14,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:14,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:14,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:14,593 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-31 17:07:14,597 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-31 17:07:14,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:14,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:14,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,630 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-31 17:07:14,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,673 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,699 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-31 17:07:14,700 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:14,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:14,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, 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-31 17:07:14,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:14,764 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-31 17:07:14,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:14,779 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-31 17:07:14,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:14,788 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-31 17:07:14,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:14,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-31 17:07:14,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:14,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:07:14,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:07:14,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:14,808 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-01-31 17:07:15,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:15,080 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-01-31 17:07:15,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:07:15,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 17:07:15,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:15,082 INFO L225 Difference]: With dead ends: 87 [2019-01-31 17:07:15,083 INFO L226 Difference]: Without dead ends: 86 [2019-01-31 17:07:15,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:07:15,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-31 17:07:15,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-31 17:07:15,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 17:07:15,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-01-31 17:07:15,103 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-01-31 17:07:15,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:15,103 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-01-31 17:07:15,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:07:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-01-31 17:07:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:15,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:15,104 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:15,105 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:15,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,105 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-01-31 17:07:15,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:15,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,306 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-31 17:07:15,346 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-31 17:07:15,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:15,347 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:15,347 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-01-31 17:07:15,348 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:15,348 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:15,350 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:15,350 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:15,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:15,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:15,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:15,351 INFO 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-31 17:07:15,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:15,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:15,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:15,367 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-31 17:07:15,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,370 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-31 17:07:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,374 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-31 17:07:15,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,380 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-31 17:07:15,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:15,389 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,418 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,433 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,445 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,474 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-31 17:07:15,474 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:15,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,525 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-31 17:07:15,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,578 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-31 17:07:15,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:15,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,640 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:15,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:15,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,692 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-31 17:07:15,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:15,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:15,740 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-31 17:07:15,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:15,797 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-31 17:07:15,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:15,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:15,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:15,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:15,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:15,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:15,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:15,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:15,923 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-01-31 17:07:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:16,493 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-01-31 17:07:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:16,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-31 17:07:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:16,497 INFO L225 Difference]: With dead ends: 133 [2019-01-31 17:07:16,497 INFO L226 Difference]: Without dead ends: 132 [2019-01-31 17:07:16,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-31 17:07:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-01-31 17:07:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:07:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-01-31 17:07:16,516 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-01-31 17:07:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:16,516 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-01-31 17:07:16,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-01-31 17:07:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:07:16,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:16,517 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:07:16,517 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-01-31 17:07:16,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:16,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:16,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:16,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:16,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:16,654 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-31 17:07:16,662 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-31 17:07:16,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:16,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:16,663 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:07:16,663 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-31 17:07:16,664 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:16,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:16,668 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:16,668 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:16,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:16,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:16,669 INFO 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-31 17:07:16,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:16,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:16,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:16,685 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-31 17:07:16,691 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-31 17:07:16,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:16,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,711 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,725 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-31 17:07:16,725 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,756 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,772 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,798 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-31 17:07:16,798 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,833 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-31 17:07:16,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,861 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-31 17:07:16,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:16,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:16,890 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-31 17:07:16,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:16,922 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-31 17:07:16,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:16,935 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-31 17:07:16,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:16,953 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-31 17:07:16,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:16,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:16,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:16,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:16,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:16,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:16,973 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-01-31 17:07:17,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:17,310 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-01-31 17:07:17,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:17,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-31 17:07:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:17,312 INFO L225 Difference]: With dead ends: 113 [2019-01-31 17:07:17,312 INFO L226 Difference]: Without dead ends: 112 [2019-01-31 17:07:17,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-31 17:07:17,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-01-31 17:07:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:07:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-01-31 17:07:17,335 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-01-31 17:07:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:17,335 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-01-31 17:07:17,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:17,335 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-01-31 17:07:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:17,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:17,336 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:07:17,337 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:17,337 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-01-31 17:07:17,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:17,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:17,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:17,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:17,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:17,471 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-31 17:07:17,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:17,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:17,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:17,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:17,472 INFO 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-31 17:07:17,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:17,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:17,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:17,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:17,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:17,495 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-31 17:07:17,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,502 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-31 17:07:17,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,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, 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-31 17:07:17,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,512 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-31 17:07:17,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,518 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-31 17:07:17,519 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,546 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,601 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-31 17:07:17,601 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:17,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-31 17:07:17,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,717 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-31 17:07:17,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:17,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,758 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-31 17:07:17,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,802 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-31 17:07:17,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:17,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,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, 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-31 17:07:17,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,894 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-31 17:07:17,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:17,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:17,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-31 17:07:17,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:17,993 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-31 17:07:17,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:18,019 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-31 17:07:18,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:18,065 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-31 17:07:18,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:18,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:07:18,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:18,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:18,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:18,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:18,085 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-01-31 17:07:18,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:18,893 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-01-31 17:07:18,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:18,894 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:07:18,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:18,896 INFO L225 Difference]: With dead ends: 136 [2019-01-31 17:07:18,896 INFO L226 Difference]: Without dead ends: 131 [2019-01-31 17:07:18,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-31 17:07:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-31 17:07:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:07:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-31 17:07:18,924 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-31 17:07:18,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:18,924 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-31 17:07:18,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:18,924 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-31 17:07:18,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:18,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:18,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:18,925 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:18,926 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-31 17:07:18,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:18,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:19,271 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-31 17:07:19,365 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-31 17:07:19,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:19,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:19,366 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:19,366 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-31 17:07:19,367 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:19,367 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:19,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:19,370 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:19,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:19,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:19,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:19,371 INFO 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-31 17:07:19,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:19,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:19,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:19,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:19,394 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-31 17:07:19,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,399 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-31 17:07:19,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,404 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-31 17:07:19,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,409 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-31 17:07:19,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,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, 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-31 17:07:19,455 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,510 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,540 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-31 17:07:19,540 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:19,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,579 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-31 17:07:19,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,618 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-31 17:07:19,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:19,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:19,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,699 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-31 17:07:19,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:19,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:19,744 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:19,745 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-31 17:07:19,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:19,794 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-31 17:07:19,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:19,814 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-31 17:07:19,814 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:19,852 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-31 17:07:19,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:19,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:19,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:19,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:19,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:19,871 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-01-31 17:07:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:20,365 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-01-31 17:07:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:20,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:20,367 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:07:20,367 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:07:20,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:07:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-01-31 17:07:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:07:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-31 17:07:20,388 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-31 17:07:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:20,388 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-31 17:07:20,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-31 17:07:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:20,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:20,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:20,389 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:20,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,389 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-01-31 17:07:20,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:20,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,538 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-31 17:07:20,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:20,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:20,538 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-01-31 17:07:20,539 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:20,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:20,541 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:20,542 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:20,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:20,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:20,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:20,542 INFO 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-31 17:07:20,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:20,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:20,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:20,559 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-31 17:07:20,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:20,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,571 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-31 17:07:20,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,581 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-31 17:07:20,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:07:20,593 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,628 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,661 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,696 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-31 17:07:20,697 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:20,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,756 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-31 17:07:20,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,801 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-31 17:07:20,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:20,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,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-31 17:07:20,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:20,945 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-31 17:07:20,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:20,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:20,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,015 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:21,015 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-31 17:07:21,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,077 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-31 17:07:21,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:21,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:21,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:21,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:21,165 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-31 17:07:21,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:21,189 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-31 17:07:21,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:21,254 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-31 17:07:21,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:21,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:21,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:21,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:21,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:21,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:21,274 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-31 17:07:21,471 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2019-01-31 17:07:22,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:22,174 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-01-31 17:07:22,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:22,175 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:22,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:22,176 INFO L225 Difference]: With dead ends: 131 [2019-01-31 17:07:22,177 INFO L226 Difference]: Without dead ends: 130 [2019-01-31 17:07:22,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-31 17:07:22,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-01-31 17:07:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:07:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-31 17:07:22,198 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-31 17:07:22,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:22,198 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-31 17:07:22,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-31 17:07:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:22,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:22,199 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:22,199 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-01-31 17:07:22,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:22,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:22,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,393 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-31 17:07:22,416 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-31 17:07:22,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:22,416 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:22,416 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-31 17:07:22,417 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:22,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:22,421 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:22,421 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:22,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:22,422 INFO 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-31 17:07:22,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:22,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:22,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:22,440 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-31 17:07:22,443 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-31 17:07:22,449 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-31 17:07:22,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:07:22,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:07:22,472 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,485 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,529 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-31 17:07:22,530 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-31 17:07:22,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,561 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-31 17:07:22,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,577 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-31 17:07:22,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:22,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:22,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-31 17:07:22,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:22,614 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-31 17:07:22,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:07:22,630 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-31 17:07:22,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:22,653 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-31 17:07:22,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:22,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:22,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:22,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:22,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:22,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:22,675 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-01-31 17:07:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:22,920 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-01-31 17:07:22,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:22,921 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:22,922 INFO L225 Difference]: With dead ends: 93 [2019-01-31 17:07:22,922 INFO L226 Difference]: Without dead ends: 92 [2019-01-31 17:07:22,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:22,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-31 17:07:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-01-31 17:07:22,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:07:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-31 17:07:22,953 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-31 17:07:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:22,953 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-31 17:07:22,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-31 17:07:22,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:22,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:22,954 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:22,954 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:22,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:22,954 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-01-31 17:07:22,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:22,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:22,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,162 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-31 17:07:23,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:23,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:23,163 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-01-31 17:07:23,164 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:23,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:23,166 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:23,166 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:23,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:23,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:23,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:23,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:23,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:23,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:23,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:23,183 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-31 17:07:23,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:23,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,199 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-31 17:07:23,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,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, 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-31 17:07:23,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,214 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-31 17:07:23,214 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,278 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,297 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:23,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,335 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-31 17:07:23,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,376 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-31 17:07:23,377 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:23,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,608 INFO L303 Elim1Store]: Index analysis took 208 ms [2019-01-31 17:07:23,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-31 17:07:23,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,654 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-31 17:07:23,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:23,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,690 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:23,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,692 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-31 17:07:23,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,745 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-31 17:07:23,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:23,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:23,793 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:23,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-31 17:07:23,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:23,839 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-31 17:07:23,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:07:23,881 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-31 17:07:23,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:23,941 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-31 17:07:23,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:23,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:23,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:23,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:23,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:23,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:23,961 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-31 17:07:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:24,916 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-01-31 17:07:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:24,917 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:24,919 INFO L225 Difference]: With dead ends: 117 [2019-01-31 17:07:24,919 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 17:07:24,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:07:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 17:07:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-01-31 17:07:24,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:07:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-01-31 17:07:24,950 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-01-31 17:07:24,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:24,950 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-01-31 17:07:24,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-01-31 17:07:24,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:24,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:24,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:24,951 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-31 17:07:24,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:24,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:24,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:24,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:24,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:25,113 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-31 17:07:25,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:25,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:25,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:25,114 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-31 17:07:25,115 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:25,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:25,118 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:25,118 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:25,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:25,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:25,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:25,118 INFO 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-31 17:07:25,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:25,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:25,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:25,136 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-31 17:07:25,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, 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-31 17:07:25,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:25,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:25,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,165 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-31 17:07:25,165 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,206 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,233 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-31 17:07:25,233 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:25,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:25,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,302 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-31 17:07:25,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:25,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,330 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-31 17:07:25,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,359 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-31 17:07:25,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:25,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:25,389 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:25,390 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-31 17:07:25,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:25,423 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-31 17:07:25,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:25,441 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-31 17:07:25,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:25,476 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-31 17:07:25,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:25,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:25,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:25,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:25,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:25,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:25,497 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-01-31 17:07:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:26,003 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-01-31 17:07:26,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:26,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:26,005 INFO L225 Difference]: With dead ends: 99 [2019-01-31 17:07:26,005 INFO L226 Difference]: Without dead ends: 98 [2019-01-31 17:07:26,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:26,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-31 17:07:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-01-31 17:07:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:07:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-01-31 17:07:26,028 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-01-31 17:07:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:26,028 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-01-31 17:07:26,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-01-31 17:07:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:26,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:26,028 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-31 17:07:26,029 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:26,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:26,029 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-01-31 17:07:26,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:26,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:26,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:26,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:26,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:26,216 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-31 17:07:26,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:26,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:26,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:26,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:26,218 INFO 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-31 17:07:26,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:07:26,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:07:26,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:07:26,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:26,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:26,238 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-31 17:07:26,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,240 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-31 17:07:26,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,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, 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-31 17:07:26,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,266 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-31 17:07:26,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,273 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-31 17:07:26,273 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,300 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,316 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,357 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-31 17:07:26,357 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:26,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,396 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-31 17:07:26,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,436 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-31 17:07:26,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:26,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,479 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-31 17:07:26,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,528 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-31 17:07:26,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:26,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:07:26,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,632 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-31 17:07:26,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:26,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:26,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 110 [2019-01-31 17:07:26,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:26,727 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-31 17:07:26,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:26,756 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-31 17:07:26,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:26,807 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-31 17:07:26,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:26,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:07:26,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:26,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:26,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:26,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:26,828 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-01-31 17:07:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:27,553 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-01-31 17:07:27,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:27,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-31 17:07:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:27,555 INFO L225 Difference]: With dead ends: 132 [2019-01-31 17:07:27,556 INFO L226 Difference]: Without dead ends: 130 [2019-01-31 17:07:27,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:07:27,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-31 17:07:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-01-31 17:07:27,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-31 17:07:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-01-31 17:07:27,594 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-01-31 17:07:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:27,594 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-01-31 17:07:27,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:07:27,595 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-01-31 17:07:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:27,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:27,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:27,596 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-01-31 17:07:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:27,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,889 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-31 17:07:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:27,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:27,916 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:27,916 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-31 17:07:27,917 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:27,918 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:27,921 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:27,921 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:27,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:27,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:27,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:27,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:27,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:27,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:27,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:27,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:27,998 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-31 17:07:28,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,002 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-31 17:07:28,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:07:28,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,019 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-31 17:07:28,019 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,048 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,063 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,106 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-31 17:07:28,106 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:28,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,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, 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-31 17:07:28,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,183 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-31 17:07:28,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:28,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,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 38 treesize of output 88 [2019-01-31 17:07:28,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,267 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-31 17:07:28,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:28,287 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-31 17:07:28,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:28,310 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-31 17:07:28,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:28,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:28,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:28,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:28,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:28,330 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-01-31 17:07:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:28,674 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-01-31 17:07:28,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:28,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:28,676 INFO L225 Difference]: With dead ends: 87 [2019-01-31 17:07:28,676 INFO L226 Difference]: Without dead ends: 86 [2019-01-31 17:07:28,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-31 17:07:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-31 17:07:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-31 17:07:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:07:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-01-31 17:07:28,718 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-01-31 17:07:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:28,718 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-01-31 17:07:28,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-01-31 17:07:28,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:28,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:28,719 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:28,719 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:28,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-01-31 17:07:28,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:28,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:28,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:28,834 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-31 17:07:28,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:28,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:28,835 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:28,835 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-01-31 17:07:28,836 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:28,836 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:28,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:28,839 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:28,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:28,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:28,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:28,839 INFO 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-31 17:07:28,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:28,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:28,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:28,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-31 17:07:28,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,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, 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-31 17:07:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,920 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-31 17:07:28,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,930 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-31 17:07:28,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:28,944 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-31 17:07:28,944 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,973 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:28,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,000 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,029 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-31 17:07:29,029 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,066 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-31 17:07:29,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,105 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-31 17:07:29,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:29,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,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 38 treesize of output 88 [2019-01-31 17:07:29,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,190 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-31 17:07:29,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:29,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,225 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:29,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:29,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-31 17:07:29,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:29,282 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-31 17:07:29,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:29,300 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-31 17:07:29,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:29,321 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-31 17:07:29,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:29,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:29,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:29,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:29,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:29,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:29,341 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-01-31 17:07:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:29,808 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-01-31 17:07:29,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:29,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:29,810 INFO L225 Difference]: With dead ends: 106 [2019-01-31 17:07:29,810 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:07:29,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:07:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-01-31 17:07:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-31 17:07:29,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-01-31 17:07:29,851 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-01-31 17:07:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:29,852 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-01-31 17:07:29,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:29,852 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-01-31 17:07:29,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:29,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:29,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:29,853 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:29,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:29,853 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-31 17:07:29,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:29,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:29,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:30,004 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-31 17:07:30,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:30,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:30,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:30,005 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-31 17:07:30,006 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:30,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:30,008 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:30,008 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:30,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:30,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:30,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:30,009 INFO 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-31 17:07:30,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:30,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:30,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:30,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, 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-31 17:07:30,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,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, 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-31 17:07:30,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:07:30,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,046 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-31 17:07:30,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,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, 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-31 17:07:30,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,083 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,140 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-31 17:07:30,140 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:30,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,253 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-31 17:07:30,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,294 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-31 17:07:30,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:30,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,331 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-31 17:07:30,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,380 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-31 17:07:30,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:30,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:30,418 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:30,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:07:30,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:30,472 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-31 17:07:30,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:30,495 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-31 17:07:30,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:30,532 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-31 17:07:30,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:30,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:30,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:30,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:30,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:30,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:30,551 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-01-31 17:07:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:31,127 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-01-31 17:07:31,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:31,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:31,129 INFO L225 Difference]: With dead ends: 102 [2019-01-31 17:07:31,129 INFO L226 Difference]: Without dead ends: 101 [2019-01-31 17:07:31,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-31 17:07:31,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-31 17:07:31,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:07:31,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-31 17:07:31,163 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-31 17:07:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:31,163 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-31 17:07:31,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-31 17:07:31,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:31,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:31,164 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:31,164 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:31,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:31,164 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-01-31 17:07:31,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:31,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:31,249 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-31 17:07:31,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:31,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:31,250 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:31,250 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-31 17:07:31,254 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:31,254 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:31,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:31,256 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:31,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:31,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:31,257 INFO 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-31 17:07:31,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:31,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:31,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:31,285 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-31 17:07:31,288 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-31 17:07:31,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:31,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,303 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:31,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,315 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-31 17:07:31,315 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,384 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-31 17:07:31,384 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:31,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,426 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-31 17:07:31,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,558 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-31 17:07:31,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:31,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:31,581 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:31,582 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-31 17:07:31,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:31,612 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-31 17:07:31,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:07:31,629 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-31 17:07:31,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:31,649 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-31 17:07:31,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:31,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:31,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:31,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:31,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:31,669 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-01-31 17:07:31,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:31,951 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-01-31 17:07:31,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:31,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:31,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:31,953 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:07:31,953 INFO L226 Difference]: Without dead ends: 93 [2019-01-31 17:07:31,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-31 17:07:31,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-31 17:07:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-01-31 17:07:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-31 17:07:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-31 17:07:31,986 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-31 17:07:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:31,986 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-31 17:07:31,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-31 17:07:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:31,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:31,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:31,987 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:31,987 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-01-31 17:07:31,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:31,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:31,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:31,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:32,510 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-31 17:07:32,638 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-31 17:07:32,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:32,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:32,639 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:32,639 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-01-31 17:07:32,640 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:32,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:32,643 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:32,643 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:32,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:32,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:32,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:32,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:32,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:32,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:32,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:32,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, 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-31 17:07:32,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:32,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:32,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,756 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:32,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:32,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,787 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,835 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-31 17:07:32,835 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:32,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,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, 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-31 17:07:32,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,906 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-31 17:07:32,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:32,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,937 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:32,938 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-31 17:07:32,938 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:32,967 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-31 17:07:32,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:07:32,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:32,999 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 69 [2019-01-31 17:07:32,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,032 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-31 17:07:33,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:07:33,048 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-31 17:07:33,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:33,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:33,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:33,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:33,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:33,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:33,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:33,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:33,120 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-01-31 17:07:33,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:33,528 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-01-31 17:07:33,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:33,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:33,530 INFO L225 Difference]: With dead ends: 116 [2019-01-31 17:07:33,530 INFO L226 Difference]: Without dead ends: 115 [2019-01-31 17:07:33,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-31 17:07:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-01-31 17:07:33,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-31 17:07:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-01-31 17:07:33,561 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-01-31 17:07:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:33,562 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-01-31 17:07:33,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-01-31 17:07:33,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:33,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:33,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:33,562 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:33,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:33,563 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-01-31 17:07:33,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:33,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:33,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:33,732 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-31 17:07:33,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:33,733 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:33,733 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-01-31 17:07:33,734 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:33,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:33,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:33,737 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:33,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:33,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:33,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:33,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:33,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:33,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:33,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:33,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:07:33,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,765 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-31 17:07:33,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,770 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-31 17:07:33,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,783 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-31 17:07:33,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07: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, 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-31 17:07:33,796 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,823 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,879 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-31 17:07:33,879 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:33,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:33,946 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-31 17:07:33,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:33,987 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-31 17:07:33,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:34,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:34,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,075 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-31 17:07:34,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:34,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,127 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:34,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:07:34,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,183 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-31 17:07:34,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:34,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,279 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:34,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:34,281 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-31 17:07:34,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:34,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-31 17:07:34,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:34,371 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-31 17:07:34,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:34,424 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-31 17:07:34,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:34,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:34,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:34,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:34,443 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-01-31 17:07:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:35,366 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-01-31 17:07:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:35,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:35,368 INFO L225 Difference]: With dead ends: 140 [2019-01-31 17:07:35,368 INFO L226 Difference]: Without dead ends: 139 [2019-01-31 17:07:35,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:35,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-31 17:07:35,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-01-31 17:07:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-31 17:07:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-01-31 17:07:35,405 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-01-31 17:07:35,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:35,406 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-01-31 17:07:35,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:35,406 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-01-31 17:07:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:35,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:35,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:35,407 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:35,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-01-31 17:07:35,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:35,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:35,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:35,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:35,512 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-31 17:07:35,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:35,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:35,512 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:35,513 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-31 17:07:35,513 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:35,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:35,515 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:35,515 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:35,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:35,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:35,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:35,516 INFO 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-31 17:07:35,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:35,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:35,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:35,536 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-31 17:07:35,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:35,545 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-31 17:07:35,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:07:35,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:07:35,567 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,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-31 17:07:35,627 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-31 17:07:35,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:35,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,675 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-31 17:07:35,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:35,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:35,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:35,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:35,717 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-31 17:07:35,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:07:35,730 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-31 17:07:35,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:35,749 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-31 17:07:35,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:35,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:35,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:35,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:35,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:35,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:35,768 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-01-31 17:07:36,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:36,059 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-01-31 17:07:36,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:36,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:36,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:36,061 INFO L225 Difference]: With dead ends: 112 [2019-01-31 17:07:36,061 INFO L226 Difference]: Without dead ends: 111 [2019-01-31 17:07:36,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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-31 17:07:36,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-31 17:07:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-01-31 17:07:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-31 17:07:36,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-01-31 17:07:36,108 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-01-31 17:07:36,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:36,108 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-01-31 17:07:36,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:36,109 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-01-31 17:07:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:36,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:36,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:36,109 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:36,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:36,110 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-01-31 17:07:36,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:36,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:36,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:36,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:36,336 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-31 17:07:36,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:36,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:36,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:36,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:36,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:36,337 INFO 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-31 17:07:36,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:36,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:36,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:36,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:36,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:36,360 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-31 17:07:36,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,367 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-31 17:07:36,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,373 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-31 17:07:36,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,380 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-31 17:07:36,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,391 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-31 17:07:36,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,420 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,447 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,476 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-31 17:07:36,476 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:36,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,513 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-31 17:07:36,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,554 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-31 17:07:36,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:36,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,594 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:36,595 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-31 17:07:36,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,640 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-31 17:07:36,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:36,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,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 36 treesize of output 78 [2019-01-31 17:07:36,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,728 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-31 17:07:36,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:36,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,843 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:36,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:36,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:36,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:36,894 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-31 17:07:36,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:36,923 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-31 17:07:36,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:36,977 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-31 17:07:36,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:36,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:36,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:36,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:36,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:36,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:36,997 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-01-31 17:07:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:37,906 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-01-31 17:07:37,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:37,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:37,908 INFO L225 Difference]: With dead ends: 137 [2019-01-31 17:07:37,908 INFO L226 Difference]: Without dead ends: 135 [2019-01-31 17:07:37,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:37,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-31 17:07:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-01-31 17:07:37,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-31 17:07:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-01-31 17:07:37,945 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-01-31 17:07:37,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:37,945 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-01-31 17:07:37,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-01-31 17:07:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:37,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:37,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:37,946 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-31 17:07:37,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:37,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:37,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:38,097 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-31 17:07:38,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:38,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:38,097 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:38,097 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-31 17:07:38,098 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:38,098 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:38,100 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:38,101 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:38,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:38,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:38,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:38,109 INFO 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-31 17:07:38,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:38,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:38,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:38,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-31 17:07:38,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,130 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-31 17:07:38,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,136 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-31 17:07:38,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,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-31 17:07:38,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:38,161 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,248 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-31 17:07:38,248 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:38,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,276 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-31 17:07:38,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,318 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-31 17:07:38,318 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,351 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:38,352 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-31 17:07:38,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,398 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-31 17:07:38,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:38,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:38,508 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-31 17:07:38,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:38,555 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-31 17:07:38,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:38,576 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-31 17:07:38,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:38,601 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-31 17:07:38,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:38,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:38,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:38,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:38,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:38,621 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-01-31 17:07:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:39,104 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-31 17:07:39,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:39,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:39,106 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:07:39,106 INFO L226 Difference]: Without dead ends: 123 [2019-01-31 17:07:39,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-31 17:07:39,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-01-31 17:07:39,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:07:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-01-31 17:07:39,148 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-01-31 17:07:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:39,148 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-01-31 17:07:39,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-01-31 17:07:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:39,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:39,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:39,149 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-31 17:07:39,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:39,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,287 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-31 17:07:39,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:39,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:39,288 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-31 17:07:39,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:39,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:39,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:39,292 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:39,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:39,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:39,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 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-31 17:07:39,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:39,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:39,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:39,310 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-31 17:07:39,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,341 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-31 17:07:39,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,348 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-31 17:07:39,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,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, 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-31 17:07:39,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,440 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-31 17:07:39,440 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:39,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,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-31 17:07:39,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,516 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-31 17:07:39,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:39,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,549 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:39,550 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-31 17:07:39,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,595 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-31 17:07:39,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:39,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:39,632 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:39,633 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-31 17:07:39,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:39,679 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-31 17:07:39,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:39,701 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-31 17:07:39,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:39,739 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-31 17:07:39,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:39,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:07:39,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:39,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:39,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:39,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:39,758 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-01-31 17:07:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:40,287 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-01-31 17:07:40,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:40,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:07:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:40,289 INFO L225 Difference]: With dead ends: 119 [2019-01-31 17:07:40,289 INFO L226 Difference]: Without dead ends: 118 [2019-01-31 17:07:40,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:40,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-31 17:07:40,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-01-31 17:07:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-31 17:07:40,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-01-31 17:07:40,336 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-01-31 17:07:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:40,336 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-01-31 17:07:40,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-01-31 17:07:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:40,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:40,337 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:40,337 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:40,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:40,338 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-01-31 17:07:40,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:40,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:40,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:40,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:40,838 WARN L181 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-31 17:07:40,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:40,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:40,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:40,900 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:40,900 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-01-31 17:07:40,901 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:40,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:40,902 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:40,903 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:40,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:40,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:40,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:40,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:40,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:40,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:40,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:40,927 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-31 17:07:40,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,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, 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-31 17:07:40,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,939 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-31 17:07:40,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,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, 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-31 17:07:40,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:40,963 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-31 17:07:40,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:40,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,047 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-31 17:07:41,048 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:41,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:07:41,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,138 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-31 17:07:41,138 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:41,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,191 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-31 17:07:41,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,249 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-31 17:07:41,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:41,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,305 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:41,305 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-31 17:07:41,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,366 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-31 17:07:41,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:41,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:41,442 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:41,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:07:41,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:41,493 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-31 17:07:41,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:41,512 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-31 17:07:41,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:41,554 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-31 17:07:41,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:41,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:41,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:41,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:41,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:41,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:41,574 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-01-31 17:07:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:42,584 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-01-31 17:07:42,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:42,584 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:42,586 INFO L225 Difference]: With dead ends: 149 [2019-01-31 17:07:42,586 INFO L226 Difference]: Without dead ends: 148 [2019-01-31 17:07:42,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:07:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-31 17:07:42,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-01-31 17:07:42,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-31 17:07:42,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-01-31 17:07:42,639 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-01-31 17:07:42,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:42,640 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-01-31 17:07:42,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:42,640 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-01-31 17:07:42,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:42,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:42,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:42,641 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:42,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:42,641 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-01-31 17:07:42,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:42,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:42,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:42,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:42,739 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-31 17:07:42,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:42,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:42,740 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:42,740 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-31 17:07:42,741 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:42,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:42,743 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:42,743 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:42,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:42,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:42,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:42,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:42,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:42,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:42,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:42,766 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-31 17:07:42,771 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-31 17:07:42,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:42,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,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, 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-31 17:07:42,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,845 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,856 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,886 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-31 17:07:42,886 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:42,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,929 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-31 17:07:42,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:42,956 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-31 17:07:42,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:42,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:42,986 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-31 17:07:42,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,016 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-31 17:07:43,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:43,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,045 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:43,046 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-31 17:07:43,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:43,081 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-31 17:07:43,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:43,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:43,131 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-31 17:07:43,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:43,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:07:43,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:43,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:43,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:07:43,149 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-01-31 17:07:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:43,670 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-01-31 17:07:43,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:43,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:43,673 INFO L225 Difference]: With dead ends: 139 [2019-01-31 17:07:43,673 INFO L226 Difference]: Without dead ends: 138 [2019-01-31 17:07:43,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-31 17:07:43,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-01-31 17:07:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:07:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-01-31 17:07:43,728 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-01-31 17:07:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:43,728 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-01-31 17:07:43,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-01-31 17:07:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:43,728 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:43,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:43,729 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:43,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-01-31 17:07:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:43,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:43,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:43,956 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-31 17:07:43,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:43,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:43,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:43,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:43,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:43,957 INFO 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-31 17:07:43,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:43,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:43,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:43,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:43,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:43,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:43,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,982 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-31 17:07:43,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,987 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-31 17:07:43,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,993 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-31 17:07:43,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:43,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,002 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-31 17:07:44,003 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,057 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,086 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-31 17:07:44,086 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:44,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,125 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-31 17:07:44,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,169 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-31 17:07:44,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:44,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:44,208 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-31 17:07:44,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,254 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-31 17:07:44,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:44,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,294 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:44,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:44,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,340 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-31 17:07:44,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:44,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:44,381 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-31 17:07:44,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:44,429 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-31 17:07:44,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:44,452 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-31 17:07:44,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:44,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:44,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:44,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:44,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:44,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:44,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:44,527 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-01-31 17:07:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:45,349 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-01-31 17:07:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:45,349 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:45,351 INFO L225 Difference]: With dead ends: 164 [2019-01-31 17:07:45,351 INFO L226 Difference]: Without dead ends: 163 [2019-01-31 17:07:45,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-31 17:07:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-01-31 17:07:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-31 17:07:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-01-31 17:07:45,406 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-01-31 17:07:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:45,406 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-01-31 17:07:45,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-01-31 17:07:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:45,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:45,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:45,407 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:45,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-31 17:07:45,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:45,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:45,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:45,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:45,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:45,525 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-31 17:07:45,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:45,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:45,526 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:45,526 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-01-31 17:07:45,527 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:45,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:45,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:45,529 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:45,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:45,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:45,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:45,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:45,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:45,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:45,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:45,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-31 17:07:45,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,559 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-31 17:07:45,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,565 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-31 17:07:45,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,573 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-31 17:07:45,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,586 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-31 17:07:45,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,632 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,673 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-31 17:07:45,674 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:45,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,707 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-31 17:07:45,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,749 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-31 17:07:45,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:45,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:45,785 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-31 17:07:45,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:45,833 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-31 17:07:45,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:45,855 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-31 17:07:45,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:45,876 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-31 17:07:45,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:45,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:45,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:45,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:45,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:45,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:45,896 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-01-31 17:07:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:46,293 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-01-31 17:07:46,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:46,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:46,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:46,295 INFO L225 Difference]: With dead ends: 122 [2019-01-31 17:07:46,296 INFO L226 Difference]: Without dead ends: 121 [2019-01-31 17:07:46,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:46,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-31 17:07:46,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-01-31 17:07:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-31 17:07:46,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-01-31 17:07:46,362 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-01-31 17:07:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:46,362 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-01-31 17:07:46,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:46,362 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-01-31 17:07:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:46,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:46,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:46,363 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:46,363 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-01-31 17:07:46,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:46,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:46,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:46,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:46,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:46,529 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-31 17:07:46,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:46,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:46,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:46,529 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-01-31 17:07:46,530 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:46,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:46,531 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:46,531 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:07:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:46,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:46,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:46,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:46,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:46,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:46,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:46,550 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-31 17:07:46,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:46,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,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, 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-31 17:07:46,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,565 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-31 17:07:46,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,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, 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-31 17:07:46,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,642 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,686 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-31 17:07:46,686 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:46,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,719 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-31 17:07:46,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,762 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-31 17:07:46,762 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:46,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,799 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:46,800 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-31 17:07:46,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,846 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-31 17:07:46,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:46,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:46,887 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-31 17:07:46,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:46,935 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-31 17:07:46,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:46,960 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-31 17:07:46,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:46,996 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-31 17:07:47,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:47,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:47,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:47,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:47,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:47,016 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-01-31 17:07:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:47,614 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-01-31 17:07:47,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:47,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:47,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:47,616 INFO L225 Difference]: With dead ends: 154 [2019-01-31 17:07:47,616 INFO L226 Difference]: Without dead ends: 153 [2019-01-31 17:07:47,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-31 17:07:47,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-31 17:07:47,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:07:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-31 17:07:47,694 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-31 17:07:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:47,694 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-31 17:07:47,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-31 17:07:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:47,695 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:47,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:47,695 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:47,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-01-31 17:07:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:47,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:47,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:47,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:47,697 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:47,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-31 17:07:47,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:47,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:47,817 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:47,817 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-31 17:07:47,818 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:47,818 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:47,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:47,820 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:47,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:47,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:47,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:47,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 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-31 17:07:47,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:47,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:47,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:47,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 18 treesize of output 21 [2019-01-31 17:07:47,841 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-31 17:07:47,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:47,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,865 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-31 17:07:47,865 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,884 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,896 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,932 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-31 17:07:47,933 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:47,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:47,970 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-31 17:07:47,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:47,996 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-31 17:07:47,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:48,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-31 17:07:48,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,054 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-31 17:07:48,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:48,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:48,094 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-31 17:07:48,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:48,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:48,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:48,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:48,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:48,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:48,114 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-01-31 17:07:48,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:48,443 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-01-31 17:07:48,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:07:48,444 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:48,446 INFO L225 Difference]: With dead ends: 130 [2019-01-31 17:07:48,446 INFO L226 Difference]: Without dead ends: 129 [2019-01-31 17:07:48,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:48,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-31 17:07:48,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-31 17:07:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-31 17:07:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-31 17:07:48,523 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-31 17:07:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:48,523 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-31 17:07:48,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-31 17:07:48,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:48,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:48,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:48,524 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:48,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:48,525 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-01-31 17:07:48,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:48,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:48,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:48,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:48,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:48,701 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-31 17:07:48,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:48,701 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:48,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:48,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:48,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:48,702 INFO 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-31 17:07:48,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:48,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:48,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:48,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:48,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:48,722 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-31 17:07:48,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,724 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-31 17:07:48,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,728 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-31 17:07:48,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,736 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-31 17:07:48,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,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, 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-31 17:07:48,746 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,829 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-31 17:07:48,830 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:48,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,867 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-31 17:07:48,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:48,910 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-31 17:07:48,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:48,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:48,971 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-31 17:07:48,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,017 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-31 17:07:49,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:49,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,056 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:49,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:49,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,116 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-31 17:07:49,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:49,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-31 17:07:49,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:49,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:49,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:07:49,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:49,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:07:49,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:07:49,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:49,192 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-01-31 17:07:49,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:49,719 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-01-31 17:07:49,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:49,719 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-31 17:07:49,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:49,721 INFO L225 Difference]: With dead ends: 160 [2019-01-31 17:07:49,721 INFO L226 Difference]: Without dead ends: 159 [2019-01-31 17:07:49,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:49,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-31 17:07:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-01-31 17:07:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-31 17:07:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-01-31 17:07:49,791 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-01-31 17:07:49,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:49,791 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-01-31 17:07:49,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:07:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-01-31 17:07:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:49,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:49,792 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:49,792 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-01-31 17:07:49,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:49,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:49,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:49,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:49,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:49,891 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-31 17:07:49,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:49,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:49,892 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:49,892 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-01-31 17:07:49,893 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:49,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:49,896 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:49,896 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:07:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:49,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:49,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:49,897 INFO 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-31 17:07:49,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:49,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:49,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:49,916 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-31 17:07:49,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-01-31 17:07:49,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:49,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,937 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:49,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:49,955 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-31 17:07:49,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:49,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,024 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-31 17:07:50,025 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:50,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,059 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-31 17:07:50,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,087 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-31 17:07:50,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:50,103 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-31 17:07:50,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:50,114 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-31 17:07:50,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:07:50,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-31 17:07:50,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:07:50,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:07:50,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:07:50,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:50,133 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-01-31 17:07:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:50,225 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-01-31 17:07:50,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:07:50,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-31 17:07:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:50,227 INFO L225 Difference]: With dead ends: 121 [2019-01-31 17:07:50,227 INFO L226 Difference]: Without dead ends: 117 [2019-01-31 17:07:50,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:07:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-31 17:07:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-31 17:07:50,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-31 17:07:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-01-31 17:07:50,294 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-01-31 17:07:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:50,294 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-01-31 17:07:50,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:07:50,294 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-01-31 17:07:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:50,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:50,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:50,295 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:50,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:50,295 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-01-31 17:07:50,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:50,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:50,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:50,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:50,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:50,440 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-31 17:07:50,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:50,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:50,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:50,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:50,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:50,441 INFO 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-31 17:07:50,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:50,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:50,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:50,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:50,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:50,462 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-31 17:07:50,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,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, 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-31 17:07:50,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,473 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-31 17:07:50,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:07:50,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,486 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-31 17:07:50,487 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,544 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,573 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-31 17:07:50,573 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:50,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,615 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-31 17:07:50,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,661 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-31 17:07:50,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:50,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:50,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,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-31 17:07:50,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:50,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,795 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:50,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, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:07:50,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:50,847 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-31 17:07:50,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:50,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:50,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:51,021 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:51,021 INFO L303 Elim1Store]: Index analysis took 148 ms [2019-01-31 17:07:51,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, 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 99 [2019-01-31 17:07:51,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:51,154 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-31 17:07:51,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:51,177 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-31 17:07:51,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:51,234 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-31 17:07:51,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:51,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:51,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:51,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:51,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:51,252 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-01-31 17:07:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:52,265 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-01-31 17:07:52,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:52,266 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:52,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:52,269 INFO L225 Difference]: With dead ends: 186 [2019-01-31 17:07:52,269 INFO L226 Difference]: Without dead ends: 184 [2019-01-31 17:07:52,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:52,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-31 17:07:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-01-31 17:07:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-31 17:07:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-01-31 17:07:52,351 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-01-31 17:07:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:52,351 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-01-31 17:07:52,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-01-31 17:07:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:52,352 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:52,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:52,352 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:52,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-01-31 17:07:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:52,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:52,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:52,427 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-31 17:07:52,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:52,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:52,427 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-31 17:07:52,428 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-01-31 17:07:52,428 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:52,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:52,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:52,432 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:07:52,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:52,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:52,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:52,432 INFO 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-31 17:07:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:52,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:52,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:52,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 18 treesize of output 21 [2019-01-31 17:07:52,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, 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-31 17:07:52,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:52,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:52,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:52,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,505 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,528 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,555 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-31 17:07:52,555 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:52,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,589 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-31 17:07:52,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,615 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-31 17:07:52,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:52,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:52,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 33 treesize of output 67 [2019-01-31 17:07:52,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:52,671 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-31 17:07:52,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:52,689 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-31 17:07:52,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:52,701 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-31 17:07:52,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:52,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:07:52,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:52,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:52,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:52,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:07:52,720 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-01-31 17:07:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:53,084 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-01-31 17:07:53,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:07:53,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:53,086 INFO L225 Difference]: With dead ends: 161 [2019-01-31 17:07:53,087 INFO L226 Difference]: Without dead ends: 160 [2019-01-31 17:07:53,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-31 17:07:53,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-31 17:07:53,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-01-31 17:07:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-31 17:07:53,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-01-31 17:07:53,165 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-01-31 17:07:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:53,165 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-01-31 17:07:53,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-01-31 17:07:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:53,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:53,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:53,166 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-01-31 17:07:53,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:53,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:53,167 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:53,504 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-31 17:07:53,652 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-31 17:07:53,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:53,653 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:53,653 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:53,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:53,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:53,653 INFO 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-31 17:07:53,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:53,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:53,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:07:53,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:53,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:53,670 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-31 17:07:53,672 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-31 17:07:53,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, 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-31 17:07:53,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:07:53,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:07:53,699 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,724 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,758 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-31 17:07:53,758 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-31 17:07:53,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,789 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-31 17:07:53,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,806 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-31 17:07:53,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:53,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:53,829 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-31 17:07:53,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:53,848 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-31 17:07:53,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:07:53,863 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-31 17:07:53,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:53,882 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-31 17:07:53,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:53,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:07:53,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:53,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:07:53,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:07:53,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:07:53,901 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-01-31 17:07:54,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:54,242 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-01-31 17:07:54,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:07:54,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-31 17:07:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:54,245 INFO L225 Difference]: With dead ends: 172 [2019-01-31 17:07:54,245 INFO L226 Difference]: Without dead ends: 170 [2019-01-31 17:07:54,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:07:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-31 17:07:54,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-01-31 17:07:54,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-31 17:07:54,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-01-31 17:07:54,326 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-01-31 17:07:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:54,327 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-01-31 17:07:54,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:07:54,327 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-01-31 17:07:54,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:54,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:54,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:54,328 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:54,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:54,328 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-01-31 17:07:54,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:54,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:54,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:54,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:54,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:54,534 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-31 17:07:54,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:54,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:54,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:54,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:54,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:54,535 INFO 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-31 17:07:54,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:07:54,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:07:54,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:07:54,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:54,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:54,556 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-31 17:07:54,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,559 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-31 17:07:54,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,565 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-31 17:07:54,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,572 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-31 17:07:54,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:54,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,664 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-31 17:07:54,664 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:54,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,704 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-31 17:07:54,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,747 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-31 17:07:54,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:54,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,785 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:54,786 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-31 17:07:54,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,826 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-31 17:07:54,827 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,867 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-31 17:07:54,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:54,916 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-31 17:07:54,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:54,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,955 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:54,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:54,957 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-31 17:07:54,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:55,005 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-31 17:07:55,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:55,034 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-31 17:07:55,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:55,104 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-31 17:07:55,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:55,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:07:55,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:55,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:55,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:55,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:07:55,122 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-01-31 17:07:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:55,908 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-01-31 17:07:55,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:55,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-31 17:07:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:55,911 INFO L225 Difference]: With dead ends: 209 [2019-01-31 17:07:55,911 INFO L226 Difference]: Without dead ends: 207 [2019-01-31 17:07:55,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-31 17:07:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-01-31 17:07:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-31 17:07:55,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-01-31 17:07:55,990 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-01-31 17:07:55,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:55,991 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-01-31 17:07:55,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-01-31 17:07:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:07:55,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:55,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:07:55,991 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:55,992 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-01-31 17:07:55,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:55,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:55,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:55,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:55,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:07:56,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:56,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:56,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:07:56,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:07:56,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:56,093 INFO 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-31 17:07:56,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:07:56,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:07:56,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:07:56,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:07:56,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:56,112 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-31 17:07:56,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:07:56,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:07:56,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,141 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:07:56,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:07:56,161 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,203 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,229 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-31 17:07:56,230 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:07:56,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,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 51 [2019-01-31 17:07:56,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,293 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-31 17:07:56,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:56,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,318 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-31 17:07:56,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,350 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-31 17:07:56,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:07:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:56,416 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:56,417 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-31 17:07:56,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:56,453 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-31 17:07:56,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:07:56,482 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-31 17:07:56,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:56,544 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-31 17:07:56,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:56,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:07:56,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:56,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:07:56,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:07:56,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:07:56,564 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-01-31 17:07:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:57,119 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-01-31 17:07:57,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:07:57,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-31 17:07:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:57,122 INFO L225 Difference]: With dead ends: 180 [2019-01-31 17:07:57,122 INFO L226 Difference]: Without dead ends: 173 [2019-01-31 17:07:57,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:07:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-31 17:07:57,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-01-31 17:07:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-31 17:07:57,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-01-31 17:07:57,222 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-01-31 17:07:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:57,222 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-01-31 17:07:57,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:07:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-01-31 17:07:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:57,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:57,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:57,223 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:57,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:57,223 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-01-31 17:07:57,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:57,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:07:57,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:57,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:57,379 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-31 17:07:57,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:57,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:57,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:57,380 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-31 17:07:57,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:57,381 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:57,382 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:57,382 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:57,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:57,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:57,383 INFO 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-31 17:07:57,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:57,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:57,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:57,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:07:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,400 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-31 17:07:57,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,406 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-31 17:07:57,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,414 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-31 17:07:57,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,425 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-31 17:07:57,426 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,512 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-31 17:07:57,512 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:57,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,550 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-31 17:07:57,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,591 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-31 17:07:57,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:57,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:57,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,673 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-31 17:07:57,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:57,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:57,716 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-31 17:07:57,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,766 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-31 17:07:57,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:57,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,807 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:57,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:57,809 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-31 17:07:57,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:57,861 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-31 17:07:57,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:07:57,882 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-31 17:07:57,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:58,065 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-31 17:07:58,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:58,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:07:58,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:07:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:07:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:58,084 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-01-31 17:07:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:07:58,928 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-01-31 17:07:58,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:07:58,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:07:58,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:07:58,931 INFO L225 Difference]: With dead ends: 189 [2019-01-31 17:07:58,931 INFO L226 Difference]: Without dead ends: 188 [2019-01-31 17:07:58,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:07:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-31 17:07:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-01-31 17:07:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-31 17:07:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-01-31 17:07:59,030 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-01-31 17:07:59,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:07:59,030 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-01-31 17:07:59,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:07:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-01-31 17:07:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:07:59,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:07:59,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:07:59,031 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:07:59,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:59,031 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-31 17:07:59,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:07:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:59,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:07:59,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:07:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:59,213 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-31 17:07:59,311 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-31 17:07:59,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:59,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:07:59,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:07:59,312 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-31 17:07:59,313 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:07:59,313 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:07:59,315 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:07:59,315 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:07:59,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:07:59,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:07:59,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:07:59,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:07:59,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:07:59,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:07:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:07:59,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:07:59,337 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-31 17:07:59,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,341 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-31 17:07:59,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:07:59,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,361 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-31 17:07:59,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,372 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-31 17:07:59,372 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,436 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,465 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:07:59,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:07:59,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,540 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-31 17:07:59,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:07:59,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,579 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-31 17:07:59,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,626 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-31 17:07:59,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:59,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,666 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:59,666 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-31 17:07:59,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,724 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-31 17:07:59,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:59,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:07:59,764 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:07:59,765 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-31 17:07:59,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:07:59,815 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-31 17:07:59,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:07:59,839 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-31 17:07:59,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:07:59,896 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-31 17:07:59,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:07:59,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:07:59,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:07:59,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:07:59,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:07:59,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:07:59,915 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-01-31 17:08:00,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:00,706 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-01-31 17:08:00,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:00,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:08:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:00,708 INFO L225 Difference]: With dead ends: 169 [2019-01-31 17:08:00,709 INFO L226 Difference]: Without dead ends: 168 [2019-01-31 17:08:00,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:08:00,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-31 17:08:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-01-31 17:08:00,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-31 17:08:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-01-31 17:08:00,812 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-01-31 17:08:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:00,812 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-01-31 17:08:00,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:08:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-01-31 17:08:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:00,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:00,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:00,813 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:00,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:00,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-31 17:08:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:00,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:00,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:00,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:00,978 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-31 17:08:01,001 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-31 17:08:01,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:01,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:01,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:01,002 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-31 17:08:01,003 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:01,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:01,005 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:01,005 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:01,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:01,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:01,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:01,005 INFO 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-31 17:08:01,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:01,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:01,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:01,024 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-31 17:08:01,029 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-31 17:08:01,036 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-31 17:08:01,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:01,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-31 17:08:01,067 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,130 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-31 17:08:01,130 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-31 17:08:01,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,156 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-31 17:08:01,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-31 17:08:01,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:01,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-31 17:08:01,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:01,192 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-31 17:08:01,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-31 17:08:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:01,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:01,221 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-31 17:08:01,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:01,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:01,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:01,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:01,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:01,241 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-01-31 17:08:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:01,541 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-01-31 17:08:01,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:01,541 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:08:01,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:01,543 INFO L225 Difference]: With dead ends: 159 [2019-01-31 17:08:01,543 INFO L226 Difference]: Without dead ends: 158 [2019-01-31 17:08:01,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-31 17:08:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-01-31 17:08:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-31 17:08:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-01-31 17:08:01,636 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-01-31 17:08:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:01,636 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-01-31 17:08:01,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-01-31 17:08:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:01,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:01,637 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:01,637 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:01,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:01,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-01-31 17:08:01,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:01,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:01,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:01,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:01,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:01,838 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-31 17:08:02,001 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-31 17:08:02,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:02,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:02,002 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:02,002 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-01-31 17:08:02,003 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:02,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:02,006 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:02,006 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:08:02,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:02,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:02,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:02,007 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:08:02,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:02,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:02,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:02,025 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-31 17:08:02,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,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, 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-31 17:08:02,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:08:02,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,069 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-31 17:08:02,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:02,075 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,129 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,158 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:02,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,193 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-31 17:08:02,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,234 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-31 17:08:02,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:02,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:02,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,319 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-31 17:08:02,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,357 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:02,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,359 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-31 17:08:02,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,409 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-31 17:08:02,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:02,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,451 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:02,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-31 17:08:02,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,500 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-31 17:08:02,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:02,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:02,562 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:02,563 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-31 17:08:02,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:02,613 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-31 17:08:02,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:02,633 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-31 17:08:02,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:02,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:02,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:08:02,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:02,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:08:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:08:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:08:02,726 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-01-31 17:08:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:03,978 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-01-31 17:08:03,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:03,979 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-31 17:08:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:03,981 INFO L225 Difference]: With dead ends: 199 [2019-01-31 17:08:03,981 INFO L226 Difference]: Without dead ends: 198 [2019-01-31 17:08:03,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:08:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-31 17:08:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-01-31 17:08:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-31 17:08:04,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-31 17:08:04,078 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-31 17:08:04,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:04,078 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-31 17:08:04,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:08:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-31 17:08:04,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:04,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:04,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:04,079 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:04,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-01-31 17:08:04,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:04,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:04,258 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-31 17:08:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:04,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:04,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:04,333 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:04,333 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-01-31 17:08:04,334 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:04,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:04,337 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:04,338 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:08:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:04,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:04,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:04,339 INFO 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-31 17:08:04,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:04,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:04,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:04,355 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-31 17:08:04,358 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-31 17:08:04,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:08:04,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:04,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,383 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-31 17:08:04,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,451 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-31 17:08:04,451 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:08:04,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,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 31 treesize of output 45 [2019-01-31 17:08:04,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,523 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-31 17:08:04,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:04,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-01-31 17:08:04,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,585 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-31 17:08:04,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:08:04,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,619 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:04,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,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 33 treesize of output 72 [2019-01-31 17:08:04,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,656 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-31 17:08:04,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:08:04,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:04,688 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:04,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:04,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:04,724 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-31 17:08:04,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:08:04,744 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-31 17:08:04,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:04,798 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-31 17:08:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:08:04,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:04,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:04,817 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-01-31 17:08:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:05,505 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-01-31 17:08:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:05,506 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:05,508 INFO L225 Difference]: With dead ends: 181 [2019-01-31 17:08:05,508 INFO L226 Difference]: Without dead ends: 180 [2019-01-31 17:08:05,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:08:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-31 17:08:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-01-31 17:08:05,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-31 17:08:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-31 17:08:05,607 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-31 17:08:05,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:05,607 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-31 17:08:05,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:05,607 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-31 17:08:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:05,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:05,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:05,608 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:05,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:05,608 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-01-31 17:08:05,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:05,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:05,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:05,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:05,845 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-31 17:08:05,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:05,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:05,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:05,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:05,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:05,846 INFO 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-31 17:08:05,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:05,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:05,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:08:05,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:05,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:05,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:08:05,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,872 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-31 17:08:05,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,878 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-31 17:08:05,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:05,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:05,898 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-31 17:08:05,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,929 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:05,998 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:06,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,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, 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-31 17:08:06,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,086 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-31 17:08:06,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:06,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,128 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-31 17:08:06,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,175 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-31 17:08:06,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:06,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,219 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:06,220 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-31 17:08:06,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,266 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-31 17:08:06,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:06,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,313 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:06,314 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-31 17:08:06,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,363 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-31 17:08:06,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:06,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,399 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:06,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:06,401 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-31 17:08:06,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:06,451 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-31 17:08:06,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:06,477 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-31 17:08:06,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:06,559 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:06,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:06,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-31 17:08:06,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:06,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:08:06,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:08:06,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:08:06,579 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-01-31 17:08:07,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:07,953 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-01-31 17:08:07,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:07,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-31 17:08:07,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:07,956 INFO L225 Difference]: With dead ends: 200 [2019-01-31 17:08:07,956 INFO L226 Difference]: Without dead ends: 199 [2019-01-31 17:08:07,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:08:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-31 17:08:08,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-01-31 17:08:08,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-31 17:08:08,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-01-31 17:08:08,056 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-01-31 17:08:08,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:08,057 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-01-31 17:08:08,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:08:08,057 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-01-31 17:08:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:08,057 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:08,057 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:08,058 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:08,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-01-31 17:08:08,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:08,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:08,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:08,271 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-31 17:08:08,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:08,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:08,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:08,272 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-31 17:08:08,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:08,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:08,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:08,275 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:08,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:08,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:08,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:08,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 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-31 17:08:08,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:08,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:08,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:08,293 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-31 17:08:08,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,296 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-31 17:08:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,300 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-31 17:08:08,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,306 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-31 17:08:08,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,313 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-31 17:08:08,314 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,404 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-31 17:08:08,404 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:08,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,441 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-31 17:08:08,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,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-31 17:08:08,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:08,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-31 17:08:08,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,602 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-31 17:08:08,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:08,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,636 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:08,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:08,638 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-31 17:08:08,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:08,691 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-31 17:08:08,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:08,715 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-31 17:08:08,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:08,754 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-31 17:08:08,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:08,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:08,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:08,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:08,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:08,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:08,773 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-01-31 17:08:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:09,324 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-01-31 17:08:09,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:09,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:09,326 INFO L225 Difference]: With dead ends: 160 [2019-01-31 17:08:09,327 INFO L226 Difference]: Without dead ends: 159 [2019-01-31 17:08:09,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:09,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-31 17:08:09,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-01-31 17:08:09,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-31 17:08:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-01-31 17:08:09,427 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-01-31 17:08:09,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:09,427 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-01-31 17:08:09,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:09,427 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-01-31 17:08:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:09,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:09,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:09,428 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:09,428 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-01-31 17:08:09,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:09,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:09,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:09,571 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-31 17:08:09,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:09,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:09,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:09,572 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-31 17:08:09,572 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:09,573 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:09,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:09,574 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:08:09,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:09,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:09,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:09,575 INFO 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-31 17:08:09,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:09,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:09,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:09,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, 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-31 17:08:09,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,671 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-31 17:08:09,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,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 23 treesize of output 37 [2019-01-31 17:08:09,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,688 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-31 17:08:09,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,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, 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-31 17:08:09,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,725 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,779 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-31 17:08:09,780 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:09,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,814 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-31 17:08:09,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,857 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-31 17:08:09,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:09,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,894 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-31 17:08:09,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:09,942 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-31 17:08:09,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:09,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:09,984 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:09,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:08:09,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,036 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-31 17:08:10,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:10,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,077 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:10,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:10,078 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-31 17:08:10,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:10,129 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-31 17:08:10,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:10,153 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-31 17:08:10,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:10,230 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-31 17:08:10,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:10,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:08:10,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:10,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:08:10,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:08:10,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:10,249 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-01-31 17:08:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:11,084 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-01-31 17:08:11,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:11,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:08:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:11,087 INFO L225 Difference]: With dead ends: 197 [2019-01-31 17:08:11,087 INFO L226 Difference]: Without dead ends: 196 [2019-01-31 17:08:11,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:08:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-31 17:08:11,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-01-31 17:08:11,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-31 17:08:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-01-31 17:08:11,216 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-01-31 17:08:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:11,217 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-01-31 17:08:11,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:08:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-01-31 17:08:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:11,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:11,218 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:11,218 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-01-31 17:08:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:11,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:11,599 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 21 [2019-01-31 17:08:11,697 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-31 17:08:11,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:11,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:11,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:11,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:11,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:11,698 INFO 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-31 17:08:11,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:11,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:11,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:11,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:11,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:11,720 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-31 17:08:11,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,722 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-31 17:08:11,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:08:11,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,733 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-31 17:08:11,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,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, 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-31 17:08:11,763 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,808 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,861 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-31 17:08:11,862 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:11,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:11,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:11,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:11,970 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-31 17:08:11,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:12,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,026 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:12,027 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-31 17:08:12,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,074 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-31 17:08:12,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,112 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-31 17:08:12,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,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-31 17:08:12,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:12,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:12,197 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:12,197 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-31 17:08:12,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:12,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:12,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:12,272 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-31 17:08:12,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:12,326 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-31 17:08:12,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:12,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:08:12,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:12,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:12,345 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-01-31 17:08:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:13,239 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-01-31 17:08:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:13,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:13,242 INFO L225 Difference]: With dead ends: 195 [2019-01-31 17:08:13,242 INFO L226 Difference]: Without dead ends: 189 [2019-01-31 17:08:13,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:08:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-31 17:08:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-01-31 17:08:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-31 17:08:13,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-01-31 17:08:13,379 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-01-31 17:08:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:13,379 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-01-31 17:08:13,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-01-31 17:08:13,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:13,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:13,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:13,380 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:13,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:13,380 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-01-31 17:08:13,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:13,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:13,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:13,514 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-31 17:08:13,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:13,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:13,515 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:13,515 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-31 17:08:13,515 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:13,515 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:13,518 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:13,518 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:13,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:13,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:13,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:13,518 INFO 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-31 17:08:13,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:13,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:13,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:13,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, 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-31 17:08:13,535 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-31 17:08:13,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:08:13,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,551 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:13,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,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, 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-31 17:08:13,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,629 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-31 17:08:13,629 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:08:13,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,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, 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-31 17:08:13,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,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-31 17:08:13,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:13,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:13,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:13,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,756 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-31 17:08:13,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:08:13,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:13,786 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-31 17:08:13,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:13,817 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-31 17:08:13,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:08:13,839 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-31 17:08:13,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:13,879 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-31 17:08:13,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:13,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:13,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:13,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:13,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:13,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:13,898 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-01-31 17:08:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:14,407 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-01-31 17:08:14,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:14,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:14,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:14,409 INFO L225 Difference]: With dead ends: 157 [2019-01-31 17:08:14,410 INFO L226 Difference]: Without dead ends: 156 [2019-01-31 17:08:14,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:14,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-31 17:08:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-01-31 17:08:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-31 17:08:14,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-01-31 17:08:14,519 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-01-31 17:08:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:14,519 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-01-31 17:08:14,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-01-31 17:08:14,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:14,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:14,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:14,520 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-01-31 17:08:14,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:14,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:14,521 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:14,684 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-31 17:08:14,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:14,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:14,685 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:14,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:14,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:14,685 INFO 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-31 17:08:14,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:14,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:14,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:14,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:14,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:14,704 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-31 17:08:14,719 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-31 17:08:14,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:08:14,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,738 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:14,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,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, 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-31 17:08:14,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,776 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,824 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-31 17:08:14,825 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:08:14,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:08:14,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,895 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-31 17:08:14,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:14,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,923 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:14,924 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-31 17:08:14,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:14,961 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-31 17:08:14,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-31 17:08:14,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:14,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, 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-31 17:08:14,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:15,020 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-31 17:08:15,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-31 17:08:15,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:15,052 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:15,053 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-31 17:08:15,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:15,088 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-31 17:08:15,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:08:15,108 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-31 17:08:15,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:15,164 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-31 17:08:15,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:15,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:08:15,183 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:15,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:15,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:15,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:15,184 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-01-31 17:08:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:15,843 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-01-31 17:08:15,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:15,844 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:15,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:15,846 INFO L225 Difference]: With dead ends: 178 [2019-01-31 17:08:15,846 INFO L226 Difference]: Without dead ends: 177 [2019-01-31 17:08:15,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:08:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-31 17:08:15,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-01-31 17:08:15,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-31 17:08:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-01-31 17:08:15,944 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-01-31 17:08:15,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:15,944 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-01-31 17:08:15,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-01-31 17:08:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:15,945 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:15,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:15,946 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:15,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:15,946 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-01-31 17:08:15,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:15,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:15,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:15,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:15,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:16,132 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-31 17:08:16,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:16,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:16,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:16,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:16,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:16,132 INFO 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-31 17:08:16,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:16,142 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:16,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:16,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:16,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:16,152 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-31 17:08:16,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,156 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-31 17:08:16,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,160 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-31 17:08:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,168 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-31 17:08:16,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:16,177 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,205 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,260 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-31 17:08:16,260 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:16,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,298 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-31 17:08:16,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,340 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-31 17:08:16,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:16,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,375 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:16,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:16,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,421 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-31 17:08:16,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:16,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-31 17:08:16,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,506 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-31 17:08:16,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:16,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:16,551 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:16,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, 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 106 [2019-01-31 17:08:16,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:16,603 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-31 17:08:16,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:16,628 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-31 17:08:16,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:16,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:16,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:08:16,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:16,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:16,704 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-01-31 17:08:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:17,669 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-01-31 17:08:17,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:08:17,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:17,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:17,671 INFO L225 Difference]: With dead ends: 204 [2019-01-31 17:08:17,672 INFO L226 Difference]: Without dead ends: 203 [2019-01-31 17:08:17,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:08:17,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-31 17:08:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-01-31 17:08:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-31 17:08:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-01-31 17:08:17,770 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-01-31 17:08:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:17,771 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-01-31 17:08:17,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-01-31 17:08:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:17,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:17,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:17,772 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-01-31 17:08:17,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:17,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:17,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:17,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:17,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:18,171 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-31 17:08:18,212 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-31 17:08:18,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:18,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:18,213 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:18,213 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-31 17:08:18,214 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:18,214 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:18,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:18,216 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:18,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:18,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:18,217 INFO 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-31 17:08:18,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:18,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:18,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:18,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-31 17:08:18,233 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-31 17:08:18,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:08:18,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,317 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:18,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,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, 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-31 17:08:18,327 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,347 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,359 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,369 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,394 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-31 17:08:18,395 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:08:18,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,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, 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-31 17:08:18,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,462 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-31 17:08:18,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:18,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,486 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:18,486 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-31 17:08:18,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,515 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-31 17:08:18,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:08:18,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:18,544 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 69 [2019-01-31 17:08:18,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:18,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:18,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:08:18,595 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-31 17:08:18,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:18,624 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-31 17:08:18,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:18,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:08:18,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:18,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:18,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:18,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:08:18,644 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-01-31 17:08:19,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:19,214 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-01-31 17:08:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:19,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:19,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:19,217 INFO L225 Difference]: With dead ends: 178 [2019-01-31 17:08:19,217 INFO L226 Difference]: Without dead ends: 177 [2019-01-31 17:08:19,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-31 17:08:19,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-01-31 17:08:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-31 17:08:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-01-31 17:08:19,315 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-01-31 17:08:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:19,315 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-01-31 17:08:19,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-01-31 17:08:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:19,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:19,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:19,316 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:19,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:19,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-01-31 17:08:19,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:19,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:19,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:19,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:19,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:19,402 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-31 17:08:19,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:19,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:19,402 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:19,402 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-01-31 17:08:19,403 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:19,403 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:19,405 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:19,406 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:19,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:19,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:19,408 INFO 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-31 17:08:19,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:19,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:19,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:19,431 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-31 17:08:19,437 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-31 17:08:19,445 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-31 17:08:19,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:08:19,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:08:19,468 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:19,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:19,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:19,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:19,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:19,525 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-31 17:08:19,526 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-31 17:08:19,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:19,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:19,570 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-31 17:08:19,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:19,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:19,591 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-31 17:08:19,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:19,612 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-31 17:08:19,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:08:19,628 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-31 17:08:19,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:19,645 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-31 17:08:19,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:19,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:19,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:19,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:19,664 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-01-31 17:08:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:20,142 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-01-31 17:08:20,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:20,142 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:08:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:20,144 INFO L225 Difference]: With dead ends: 134 [2019-01-31 17:08:20,144 INFO L226 Difference]: Without dead ends: 133 [2019-01-31 17:08:20,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-31 17:08:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-31 17:08:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-01-31 17:08:20,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-31 17:08:20,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-31 17:08:20,241 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-31 17:08:20,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:20,242 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-31 17:08:20,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:20,242 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-31 17:08:20,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:20,242 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:20,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:20,242 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:20,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:20,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-01-31 17:08:20,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:20,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:20,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:20,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:20,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:20,386 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-31 17:08:20,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:20,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:20,386 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:20,386 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-01-31 17:08:20,387 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:20,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:20,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:20,390 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:20,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:20,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:20,391 INFO 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-31 17:08:20,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:20,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:20,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:20,426 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-31 17:08:20,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,459 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-31 17:08:20,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,463 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-31 17:08:20,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,469 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-31 17:08:20,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:20,477 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,506 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,562 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-31 17:08:20,562 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:20,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,595 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-31 17:08:20,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,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-31 17:08:20,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:20,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,679 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-31 17:08:20,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,725 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-31 17:08:20,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:20,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:20,762 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:20,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, 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-31 17:08:20,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:20,813 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-31 17:08:20,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:20,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:20,873 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-31 17:08:20,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:20,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:20,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:20,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:20,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:20,892 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-31 17:08:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:21,484 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-01-31 17:08:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:21,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:21,486 INFO L225 Difference]: With dead ends: 143 [2019-01-31 17:08:21,486 INFO L226 Difference]: Without dead ends: 142 [2019-01-31 17:08:21,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-31 17:08:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-01-31 17:08:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-31 17:08:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-31 17:08:21,587 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-31 17:08:21,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:21,587 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-31 17:08:21,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-31 17:08:21,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:21,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:21,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:21,588 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:21,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-01-31 17:08:21,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:21,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:21,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:21,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:21,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:22,096 WARN L181 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-31 17:08:22,244 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-31 17:08:22,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:22,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:22,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:22,245 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-01-31 17:08:22,245 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:22,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:22,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:22,248 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:22,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:22,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:22,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:22,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:08:22,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:22,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:22,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:22,302 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-31 17:08:22,345 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-31 17:08:22,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:08:22,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,567 INFO L303 Elim1Store]: Index analysis took 136 ms [2019-01-31 17:08:22,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:08:22,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:08:22,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,640 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-31 17:08:22,641 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-31 17:08:22,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,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, 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-31 17:08:22,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,690 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-31 17:08:22,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:22,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,711 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-31 17:08:22,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,730 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-31 17:08:22,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:22,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:22,750 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:22,751 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-31 17:08:22,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:22,771 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-31 17:08:22,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:08:22,785 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-31 17:08:22,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:22,807 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-31 17:08:22,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:22,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:08:22,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:22,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:22,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:22,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:08:22,826 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-31 17:08:23,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:23,307 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-01-31 17:08:23,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:23,308 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:23,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:23,310 INFO L225 Difference]: With dead ends: 151 [2019-01-31 17:08:23,310 INFO L226 Difference]: Without dead ends: 150 [2019-01-31 17:08:23,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:08:23,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-31 17:08:23,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-01-31 17:08:23,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-31 17:08:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-01-31 17:08:23,416 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-01-31 17:08:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:23,416 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-01-31 17:08:23,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-01-31 17:08:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:23,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:23,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:23,417 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:23,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-01-31 17:08:23,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:23,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:23,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:23,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:23,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:23,586 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-31 17:08:23,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:23,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:23,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:23,587 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-31 17:08:23,588 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:23,588 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:23,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:23,590 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:08:23,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:23,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:23,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:23,592 INFO 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-31 17:08:23,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:23,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:23,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:23,607 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-31 17:08:23,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,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, 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-31 17:08:23,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,616 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-31 17:08:23,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:23,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,629 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-31 17:08:23,630 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,658 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,714 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-31 17:08:23,715 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:23,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,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-31 17:08:23,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:23,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:23,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:23,939 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:23,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-31 17:08:23,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:23,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:23,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:24,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,030 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:24,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:24,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,077 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-31 17:08:24,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:24,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:24,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 36 treesize of output 86 [2019-01-31 17:08:24,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:24,170 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-31 17:08:24,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:24,192 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-31 17:08:24,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:24,235 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-31 17:08:24,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:24,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:08:24,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:24,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:24,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:24,256 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-01-31 17:08:25,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:25,104 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-01-31 17:08:25,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:25,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:25,107 INFO L225 Difference]: With dead ends: 215 [2019-01-31 17:08:25,107 INFO L226 Difference]: Without dead ends: 214 [2019-01-31 17:08:25,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:08:25,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-31 17:08:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-01-31 17:08:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-31 17:08:25,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-01-31 17:08:25,242 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-01-31 17:08:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:25,243 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-01-31 17:08:25,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-01-31 17:08:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:25,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:25,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:25,244 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:25,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-31 17:08:25,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:25,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:25,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:25,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:25,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:25,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:25,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:25,269 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:25,269 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-31 17:08:25,273 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:25,273 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:25,275 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:25,275 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:08:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:25,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:25,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:25,275 INFO 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-31 17:08:25,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:25,290 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:25,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:25,302 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-31 17:08:25,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:08:25,313 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-31 17:08:25,327 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-31 17:08:25,344 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-31 17:08:25,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,358 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,377 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,396 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-31 17:08:25,396 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-31 17:08:25,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:25,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:08:25,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:25,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-31 17:08:25,486 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-31 17:08:25,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:25,495 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-31 17:08:25,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-31 17:08:25,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-31 17:08:25,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:08:25,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:08:25,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:08:25,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:08:25,515 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-01-31 17:08:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:25,856 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-01-31 17:08:25,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:08:25,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-31 17:08:25,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:25,860 INFO L225 Difference]: With dead ends: 280 [2019-01-31 17:08:25,860 INFO L226 Difference]: Without dead ends: 275 [2019-01-31 17:08:25,860 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-31 17:08:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-31 17:08:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-01-31 17:08:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-31 17:08:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-01-31 17:08:26,102 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-01-31 17:08:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:26,102 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-01-31 17:08:26,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:08:26,102 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-01-31 17:08:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:26,103 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:26,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:26,103 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:26,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-01-31 17:08:26,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:26,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:26,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:26,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:26,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:26,241 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-31 17:08:26,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:26,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:26,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:26,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:26,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:26,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:08:26,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:26,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:26,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:26,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:26,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:26,263 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-31 17:08:26,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,268 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-31 17:08:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,273 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-31 17:08:26,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,282 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-31 17:08:26,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,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, 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-31 17:08:26,290 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,318 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,372 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-31 17:08:26,372 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:26,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,411 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-31 17:08:26,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,452 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-31 17:08:26,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:26,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:26,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,544 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-31 17:08:26,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:26,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,582 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:26,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, 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-31 17:08:26,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:26,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:26,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:26,679 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:26,680 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-31 17:08:26,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:26,731 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-31 17:08:26,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:26,757 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-31 17:08:26,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:26,805 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-31 17:08:26,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:26,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:08:26,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:26,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:08:26,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:08:26,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:26,826 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-01-31 17:08:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:27,864 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-01-31 17:08:27,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:27,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-31 17:08:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:27,868 INFO L225 Difference]: With dead ends: 329 [2019-01-31 17:08:27,869 INFO L226 Difference]: Without dead ends: 328 [2019-01-31 17:08:27,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:08:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-31 17:08:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-01-31 17:08:28,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-31 17:08:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-01-31 17:08:28,148 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-01-31 17:08:28,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:28,148 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-01-31 17:08:28,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:08:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-01-31 17:08:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:28,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:28,149 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:28,149 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:28,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-31 17:08:28,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:28,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:28,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:28,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:28,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:28,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:28,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:28,289 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:28,289 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-31 17:08:28,290 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:28,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:28,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:28,292 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:28,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:28,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:28,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:28,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 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-31 17:08:28,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:28,313 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:28,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:28,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 18 treesize of output 21 [2019-01-31 17:08:28,361 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-31 17:08:28,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:08:28,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:28,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,383 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-31 17:08:28,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,403 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,448 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-31 17:08:28,449 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:08:28,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:28,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:28,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:28,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:28,539 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-31 17:08:28,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:28,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:28,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:28,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:28,612 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-31 17:08:28,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:28,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:08:28,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:28,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:28,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:28,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:08:28,632 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-01-31 17:08:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:29,211 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-01-31 17:08:29,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:29,212 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:08:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:29,214 INFO L225 Difference]: With dead ends: 290 [2019-01-31 17:08:29,214 INFO L226 Difference]: Without dead ends: 286 [2019-01-31 17:08:29,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 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-31 17:08:29,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-31 17:08:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-01-31 17:08:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-31 17:08:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-01-31 17:08:29,477 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-01-31 17:08:29,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:29,477 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-01-31 17:08:29,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-01-31 17:08:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:29,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:29,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:29,482 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:29,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-01-31 17:08:29,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:29,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:29,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:29,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:29,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:29,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:29,603 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-31 17:08:29,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:29,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:29,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:29,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:29,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:29,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 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-31 17:08:29,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:29,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:29,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:29,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:29,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:29,621 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-31 17:08:29,627 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-31 17:08:29,630 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-31 17:08:29,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:08:29,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:08:29,654 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,669 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,677 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,711 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-31 17:08:29,711 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-31 17:08:29,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,744 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-31 17:08:29,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,761 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-31 17:08:29,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:29,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,784 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:29,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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 42 [2019-01-31 17:08:29,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,801 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-31 17:08:29,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:29,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:29,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, 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-31 17:08:29,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:29,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:29,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:29,860 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-31 17:08:29,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:29,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:29,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:29,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:29,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:29,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:29,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:29,911 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-01-31 17:08:30,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:30,533 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-01-31 17:08:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:30,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:30,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:30,535 INFO L225 Difference]: With dead ends: 307 [2019-01-31 17:08:30,535 INFO L226 Difference]: Without dead ends: 302 [2019-01-31 17:08:30,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-31 17:08:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-01-31 17:08:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-31 17:08:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-01-31 17:08:30,787 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-01-31 17:08:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:30,788 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-01-31 17:08:30,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-01-31 17:08:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:30,788 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:30,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:30,788 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-01-31 17:08:30,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:30,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:30,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:30,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:30,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:31,019 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-31 17:08:31,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:31,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:31,020 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:31,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:31,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:31,020 INFO 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-31 17:08:31,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:08:31,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:08:31,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:08:31,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:31,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:31,036 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-31 17:08:31,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:08:31,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:08:31,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:31,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,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, 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-31 17:08:31,074 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,102 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,159 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:31,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,201 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-31 17:08:31,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,245 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-31 17:08:31,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:31,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,293 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:31,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:31,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,339 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-31 17:08:31,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:31,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,380 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:31,381 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-31 17:08:31,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,429 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-31 17:08:31,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:31,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,479 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-31 17:08:31,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,524 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-31 17:08:31,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:31,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,564 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:31,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:31,566 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-31 17:08:31,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:31,617 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-31 17:08:31,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:31,647 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-31 17:08:31,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:31,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:31,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-31 17:08:31,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:31,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:08:31,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:08:31,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:08:31,752 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-01-31 17:08:33,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:33,082 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-01-31 17:08:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:33,083 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-31 17:08:33,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:33,086 INFO L225 Difference]: With dead ends: 284 [2019-01-31 17:08:33,086 INFO L226 Difference]: Without dead ends: 279 [2019-01-31 17:08:33,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:08:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-31 17:08:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-01-31 17:08:33,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-31 17:08:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-01-31 17:08:33,353 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-01-31 17:08:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:33,353 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-01-31 17:08:33,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:08:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-01-31 17:08:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:33,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:33,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:33,354 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:33,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:33,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-01-31 17:08:33,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:33,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:33,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:33,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:33,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:33,446 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-31 17:08:33,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:33,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:33,447 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:33,447 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-31 17:08:33,448 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:33,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:33,451 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:33,451 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:33,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:33,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:33,452 INFO 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-31 17:08:33,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:33,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:33,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:33,472 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-31 17:08:33,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:08:33,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,481 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-31 17:08:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,486 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-31 17:08:33,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,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, 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-31 17:08:33,492 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:33,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:33,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:33,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:33,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:33,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:33,575 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:33,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08: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, 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-31 17:08:33,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:33,651 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-31 17:08:33,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:33,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:33,686 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-31 17:08:33,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:33,733 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-31 17:08:33,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:33,753 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-31 17:08:33,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:33,764 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-31 17:08:33,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:33,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-31 17:08:33,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:33,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:08:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:08:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:08:33,783 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-01-31 17:08:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:34,314 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-01-31 17:08:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:08:34,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-31 17:08:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:34,316 INFO L225 Difference]: With dead ends: 230 [2019-01-31 17:08:34,316 INFO L226 Difference]: Without dead ends: 223 [2019-01-31 17:08:34,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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-31 17:08:34,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-31 17:08:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-01-31 17:08:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-31 17:08:34,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-01-31 17:08:34,594 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-01-31 17:08:34,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:34,594 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-01-31 17:08:34,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:08:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-01-31 17:08:34,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:34,595 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:34,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:34,595 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:34,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-01-31 17:08:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:34,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:34,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:34,679 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-31 17:08:34,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:34,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:34,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:34,680 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-01-31 17:08:34,683 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:34,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:34,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:34,685 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:34,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:34,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:34,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:34,686 INFO 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-31 17:08:34,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:34,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:34,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:34,710 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-31 17:08:34,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,713 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-31 17:08:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,717 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-31 17:08:34,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,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-31 17:08:34,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,732 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-31 17:08:34,733 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,820 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-31 17:08:34,821 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:34,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,852 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-31 17:08:34,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,896 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-31 17:08:34,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:34,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:34,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, 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-31 17:08:34,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:34,983 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-31 17:08:34,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:35,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:35,020 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:35,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:08:35,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:35,075 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-31 17:08:35,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:35,093 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-31 17:08:35,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:35,112 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-31 17:08:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:35,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-31 17:08:35,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:35,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:08:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:08:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:35,132 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-01-31 17:08:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:35,829 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-01-31 17:08:35,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:35,830 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-31 17:08:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:35,833 INFO L225 Difference]: With dead ends: 254 [2019-01-31 17:08:35,833 INFO L226 Difference]: Without dead ends: 253 [2019-01-31 17:08:35,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-31 17:08:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-01-31 17:08:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-31 17:08:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-01-31 17:08:36,113 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-01-31 17:08:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:36,114 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-01-31 17:08:36,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:08:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-01-31 17:08:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:36,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:36,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:36,114 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:36,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-01-31 17:08:36,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:36,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:36,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:36,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:36,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:36,186 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-31 17:08:36,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:36,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:36,186 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:36,187 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-31 17:08:36,188 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:36,188 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:36,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:36,190 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:36,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:36,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:36,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:36,190 INFO 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-31 17:08:36,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:36,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:36,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:36,219 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-31 17:08:36,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,221 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-31 17:08:36,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,226 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-31 17:08:36,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,230 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-31 17:08:36,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,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, 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-31 17:08:36,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,294 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,324 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-31 17:08:36,324 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:36,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,356 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-31 17:08:36,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,397 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-31 17:08:36,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:36,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:36,431 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:36,431 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-31 17:08:36,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:36,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:36,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:36,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:36,514 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-31 17:08:36,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:36,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:08:36,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:36,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:08:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:08:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:08:36,532 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-01-31 17:08:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:37,006 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-01-31 17:08:37,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:37,006 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 17:08:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:37,009 INFO L225 Difference]: With dead ends: 223 [2019-01-31 17:08:37,009 INFO L226 Difference]: Without dead ends: 216 [2019-01-31 17:08:37,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:37,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-31 17:08:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-01-31 17:08:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-31 17:08:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-01-31 17:08:37,289 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-01-31 17:08:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:37,289 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-01-31 17:08:37,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:08:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-01-31 17:08:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:37,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:37,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:37,290 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:37,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-01-31 17:08:37,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:37,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:37,531 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-31 17:08:37,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:37,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:37,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:37,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:37,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:37,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-31 17:08:37,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:08:37,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:08:37,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:08:37,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:37,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:37,548 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-31 17:08:37,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,555 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-31 17:08:37,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,561 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-31 17:08:37,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,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, 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-31 17:08:37,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,581 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-31 17:08:37,582 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,662 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-31 17:08:37,662 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:37,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:37,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,740 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-31 17:08:37,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:37,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:37,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,830 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-31 17:08:37,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:37,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,873 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:37,873 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-31 17:08:37,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:37,921 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-31 17:08:37,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:37,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:37,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:37,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, 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-31 17:08:37,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:38,017 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-31 17:08:38,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:38,048 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-31 17:08:38,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:38,112 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-31 17:08:38,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:38,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:08:38,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:38,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:08:38,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:08:38,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:08:38,133 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-01-31 17:08:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:39,239 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-01-31 17:08:39,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:08:39,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-31 17:08:39,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:39,244 INFO L225 Difference]: With dead ends: 285 [2019-01-31 17:08:39,244 INFO L226 Difference]: Without dead ends: 279 [2019-01-31 17:08:39,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:08:39,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-31 17:08:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-01-31 17:08:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-31 17:08:39,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-01-31 17:08:39,505 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-01-31 17:08:39,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:39,505 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-01-31 17:08:39,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:08:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-01-31 17:08:39,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:39,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:39,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:39,506 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-01-31 17:08:39,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:39,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:39,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:39,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:39,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:39,613 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-31 17:08:39,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:39,613 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:39,613 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:39,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:39,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:39,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 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-31 17:08:39,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:39,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:39,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:39,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:39,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:39,635 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-31 17:08:39,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,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, 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-31 17:08:39,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,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, 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-31 17:08:39,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,656 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-31 17:08:39,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,669 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-31 17:08:39,669 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:39,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:39,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:39,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:39,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:39,753 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-31 17:08:39,753 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:39,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,908 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-31 17:08:39,909 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-31 17:08:39,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:39,949 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-31 17:08:39,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:39,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:39,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:40,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:40,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:40,044 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-31 17:08:40,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:40,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:40,079 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-31 17:08:40,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:40,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:08:40,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:40,148 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-31 17:08:40,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:40,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:40,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:40,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:40,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:40,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:40,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:40,201 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-01-31 17:08:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:40,985 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-01-31 17:08:40,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:40,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:40,989 INFO L225 Difference]: With dead ends: 252 [2019-01-31 17:08:40,989 INFO L226 Difference]: Without dead ends: 247 [2019-01-31 17:08:40,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-31 17:08:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-01-31 17:08:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-31 17:08:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-01-31 17:08:41,243 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-01-31 17:08:41,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:41,243 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-01-31 17:08:41,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:41,243 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-01-31 17:08:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:41,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:41,243 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:41,244 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:41,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-31 17:08:41,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:41,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:41,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:41,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:41,331 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-31 17:08:41,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:41,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:41,331 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:41,331 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-31 17:08:41,332 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:41,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:41,335 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:41,335 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:41,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:41,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:41,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:41,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:41,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:41,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:41,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:41,354 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-31 17:08:41,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,358 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-31 17:08:41,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,364 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-31 17:08:41,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,377 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-31 17:08:41,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,389 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-31 17:08:41,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,441 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,482 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-31 17:08:41,483 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:41,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,515 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-31 17:08:41,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,558 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-31 17:08:41,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:41,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:41,591 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-31 17:08:41,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:41,638 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-31 17:08:41,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:41,661 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-31 17:08:41,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:41,681 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-31 17:08:41,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:41,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:08:41,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:41,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:08:41,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:08:41,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:08:41,702 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-01-31 17:08:42,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:42,190 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-01-31 17:08:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:42,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 17:08:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:42,192 INFO L225 Difference]: With dead ends: 194 [2019-01-31 17:08:42,192 INFO L226 Difference]: Without dead ends: 193 [2019-01-31 17:08:42,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:42,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-31 17:08:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-31 17:08:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-31 17:08:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-01-31 17:08:42,446 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-01-31 17:08:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:42,447 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-01-31 17:08:42,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:08:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-01-31 17:08:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:42,447 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:42,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:42,447 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:42,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:42,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-01-31 17:08:42,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:42,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:42,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:42,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:42,621 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-31 17:08:42,681 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-31 17:08:42,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:42,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:42,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:42,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:42,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:42,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:42,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:42,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:42,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:42,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:42,701 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-31 17:08:42,705 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-31 17:08:42,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:08:42,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,734 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:42,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,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, 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-31 17:08:42,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,793 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,820 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-31 17:08:42,820 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:08:42,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,866 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-31 17:08:42,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,895 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-31 17:08:42,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:42,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,934 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-31 17:08:42,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:42,964 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-31 17:08:42,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:42,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,990 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:42,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:42,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:42,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:43,024 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-31 17:08:43,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:08:43,045 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-31 17:08:43,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:43,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:43,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:43,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:43,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:43,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:43,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:43,097 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-01-31 17:08:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:43,916 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-01-31 17:08:43,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:43,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-31 17:08:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:43,919 INFO L225 Difference]: With dead ends: 265 [2019-01-31 17:08:43,919 INFO L226 Difference]: Without dead ends: 264 [2019-01-31 17:08:43,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-31 17:08:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-01-31 17:08:44,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-31 17:08:44,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-01-31 17:08:44,249 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-01-31 17:08:44,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:44,249 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-01-31 17:08:44,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:44,249 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-01-31 17:08:44,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:44,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:44,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:44,250 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:44,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:44,250 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-01-31 17:08:44,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:44,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:44,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:44,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:44,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:44,322 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-31 17:08:44,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:44,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:44,323 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:44,323 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-31 17:08:44,324 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:44,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:44,326 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:44,326 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:44,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:44,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:44,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:44,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:44,335 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:44,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:44,342 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-31 17:08:44,347 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-31 17:08:44,354 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-31 17:08:44,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:08:44,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:08:44,377 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:44,392 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:44,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:44,412 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:44,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:44,436 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-31 17:08:44,437 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-31 17:08:44,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,470 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-31 17:08:44,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:44,487 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-31 17:08:44,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:44,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:44,509 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:44,510 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 42 [2019-01-31 17:08:44,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:44,528 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-31 17:08:44,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:44,546 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-31 17:08:44,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:44,565 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-31 17:08:44,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:44,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:08:44,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:44,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:08:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:08:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:08:44,585 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-01-31 17:08:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:45,075 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-01-31 17:08:45,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:45,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 17:08:45,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:45,077 INFO L225 Difference]: With dead ends: 210 [2019-01-31 17:08:45,077 INFO L226 Difference]: Without dead ends: 203 [2019-01-31 17:08:45,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-31 17:08:45,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-31 17:08:45,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-31 17:08:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-01-31 17:08:45,405 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-01-31 17:08:45,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:45,405 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-01-31 17:08:45,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:08:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-01-31 17:08:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-31 17:08:45,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:45,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:45,406 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:45,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:45,406 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-01-31 17:08:45,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:45,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:45,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:08:45,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:45,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:45,486 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-31 17:08:45,486 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-01-31 17:08:45,487 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:45,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:45,488 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:45,488 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:08:45,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:45,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:45,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:45,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:45,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:45,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:45,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:45,506 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-31 17:08:45,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-31 17:08:45,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:08:45,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:08:45,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,539 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-31 17:08:45,540 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:45,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:45,572 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:45,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:45,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:45,609 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-31 17:08:45,609 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:08:45,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,653 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-31 17:08:45,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:45,682 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-31 17:08:45,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:45,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:45,709 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-31 17:08:45,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:45,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-31 17:08:45,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:08:45,761 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-31 17:08:45,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:46,043 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-31 17:08:46,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:46,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:08:46,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:46,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:08:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:08:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:08:46,062 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-01-31 17:08:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:46,615 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-01-31 17:08:46,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:08:46,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-31 17:08:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:46,617 INFO L225 Difference]: With dead ends: 216 [2019-01-31 17:08:46,617 INFO L226 Difference]: Without dead ends: 212 [2019-01-31 17:08:46,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:08:46,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-31 17:08:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-01-31 17:08:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-31 17:08:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-01-31 17:08:46,962 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-01-31 17:08:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:46,963 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-01-31 17:08:46,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:08:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-01-31 17:08:46,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:08:46,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:46,963 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:46,963 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:46,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-01-31 17:08:46,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:46,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:46,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:46,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:47,045 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-31 17:08:47,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:47,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:47,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:47,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:47,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:47,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:47,056 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:47,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:47,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:08:47,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:47,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:47,067 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-31 17:08:47,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,075 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-31 17:08:47,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,081 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-31 17:08:47,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,089 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-31 17:08:47,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,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, 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-31 17:08:47,097 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,180 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-31 17:08:47,180 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:47,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,208 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-31 17:08:47,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,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-31 17:08:47,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:47,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,426 INFO L303 Elim1Store]: Index analysis took 158 ms [2019-01-31 17:08:47,427 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-31 17:08:47,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,475 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-31 17:08:47,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:47,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:47,517 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-31 17:08:47,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:47,562 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-31 17:08:47,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:47,583 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-31 17:08:47,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:08:47,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:47,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:08:47,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:47,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:47,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:47,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:08:47,622 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-01-31 17:08:48,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:48,674 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-01-31 17:08:48,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:48,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:08:48,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:48,677 INFO L225 Difference]: With dead ends: 401 [2019-01-31 17:08:48,677 INFO L226 Difference]: Without dead ends: 397 [2019-01-31 17:08:48,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-31 17:08:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-01-31 17:08:49,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-31 17:08:49,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-01-31 17:08:49,270 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-01-31 17:08:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:49,270 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-01-31 17:08:49,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-01-31 17:08:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:08:49,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:49,271 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:49,271 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:49,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-01-31 17:08:49,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:49,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:49,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:49,322 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-31 17:08:49,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:08:49,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-31 17:08:49,322 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:08:49,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:08:49,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:08:49,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:08:49,323 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-01-31 17:08:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:49,939 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-01-31 17:08:49,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:08:49,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-31 17:08:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:49,942 INFO L225 Difference]: With dead ends: 347 [2019-01-31 17:08:49,942 INFO L226 Difference]: Without dead ends: 342 [2019-01-31 17:08:49,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-31 17:08:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-31 17:08:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-31 17:08:50,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-31 17:08:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-01-31 17:08:50,543 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-01-31 17:08:50,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:50,543 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-01-31 17:08:50,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:08:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-01-31 17:08:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:08:50,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:50,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:50,544 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:50,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:50,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-01-31 17:08:50,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:50,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:50,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:50,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:50,850 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-31 17:08:50,960 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-31 17:08:50,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:50,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:50,960 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:08:50,961 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-31 17:08:50,961 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:50,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:50,963 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:50,963 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:08:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:50,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:50,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:50,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:50,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:50,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:50,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:50,982 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-31 17:08:50,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:50,986 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-31 17:08:50,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:50,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:50,994 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-31 17:08:50,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:50,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:50,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:50,999 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-31 17:08:51,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:08:51,006 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,121 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,136 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,177 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:51,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,214 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-31 17:08:51,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,253 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-31 17:08:51,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:51,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,293 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-31 17:08:51,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,338 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-31 17:08:51,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:51,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,380 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:51,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:51,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,431 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-31 17:08:51,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:51,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:51,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:08:51,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,524 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-31 17:08:51,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:51,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,563 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:51,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:51,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 38 treesize of output 93 [2019-01-31 17:08:51,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:51,627 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-31 17:08:51,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:51,649 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-31 17:08:51,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:51,712 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-31 17:08:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:51,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-31 17:08:51,731 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:51,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:08:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:08:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:08:51,731 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-01-31 17:08:53,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:53,428 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-01-31 17:08:53,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:53,429 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-31 17:08:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:53,432 INFO L225 Difference]: With dead ends: 471 [2019-01-31 17:08:53,432 INFO L226 Difference]: Without dead ends: 470 [2019-01-31 17:08:53,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:08:53,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-31 17:08:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-01-31 17:08:54,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-31 17:08:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-01-31 17:08:54,075 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-01-31 17:08:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:54,075 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-01-31 17:08:54,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:08:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-01-31 17:08:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:08:54,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:54,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:54,076 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-01-31 17:08:54,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:54,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:54,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:54,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:54,273 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-31 17:08:54,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:54,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:54,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:08:54,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:08:54,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:54,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:54,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:08:54,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:08:54,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:08:54,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:08:54,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:54,293 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-31 17:08:54,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,297 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-31 17:08:54,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,303 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-31 17:08:54,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,311 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-31 17:08:54,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,321 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-31 17:08:54,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,380 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,409 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:54,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,451 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-31 17:08:54,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,494 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-31 17:08:54,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:54,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,536 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-31 17:08:54,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,581 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-31 17:08:54,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:54,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,623 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:54,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,624 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-31 17:08:54,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,673 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-31 17:08:54,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-31 17:08:54,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:54,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:08:54,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,766 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-31 17:08:54,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:54,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:54,810 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:54,811 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-31 17:08:54,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:54,860 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-31 17:08:54,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:08:54,886 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-31 17:08:54,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:54,964 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-31 17:08:54,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:54,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-31 17:08:54,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:54,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:08:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:08:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:08:54,984 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-01-31 17:08:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:56,716 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-01-31 17:08:56,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:08:56,717 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-31 17:08:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:56,719 INFO L225 Difference]: With dead ends: 483 [2019-01-31 17:08:56,719 INFO L226 Difference]: Without dead ends: 482 [2019-01-31 17:08:56,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:08:56,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-31 17:08:57,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-01-31 17:08:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-31 17:08:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-01-31 17:08:57,403 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-01-31 17:08:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:57,403 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-01-31 17:08:57,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:08:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-01-31 17:08:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:08:57,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:57,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:57,404 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-01-31 17:08:57,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:57,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:57,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:08:57,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:57,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:57,525 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-31 17:08:57,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:57,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:57,525 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:08:57,526 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:08:57,526 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:57,526 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:57,528 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:57,528 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:57,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:57,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:57,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:57,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:57,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:57,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:57,545 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-31 17:08:57,547 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-31 17:08:57,557 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-31 17:08:57,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:08:57,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:08:57,587 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,601 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,645 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-31 17:08:57,645 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-31 17:08:57,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,679 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-31 17:08:57,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-01-31 17:08:57,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-31 17:08:57,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,732 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-31 17:08:57,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-31 17:08:57,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:57,760 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:08:57,760 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-31 17:08:57,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:57,780 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-31 17:08:57,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:08:57,799 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-31 17:08:57,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:08:57,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-31 17:08:57,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:08:57,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:08:57,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:08:57,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:08:57,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:08:57,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:08:57,854 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-01-31 17:08:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:08:58,877 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-01-31 17:08:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:08:58,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:08:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:08:58,879 INFO L225 Difference]: With dead ends: 400 [2019-01-31 17:08:58,879 INFO L226 Difference]: Without dead ends: 393 [2019-01-31 17:08:58,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:08:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-31 17:08:59,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-01-31 17:08:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-31 17:08:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-01-31 17:08:59,535 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-01-31 17:08:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:08:59,535 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-01-31 17:08:59,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:08:59,535 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-01-31 17:08:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:08:59,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:08:59,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:08:59,536 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:08:59,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-01-31 17:08:59,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:08:59,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:59,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:59,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:08:59,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:08:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:59,658 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-31 17:08:59,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:59,659 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:08:59,659 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:08:59,659 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-31 17:08:59,659 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:08:59,660 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:08:59,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:08:59,662 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:08:59,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:08:59,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:08:59,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:08:59,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:08:59,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:08:59,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:08:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:08:59,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:08:59,681 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-31 17:08:59,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,687 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-31 17:08:59,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,692 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-31 17:08:59,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:08:59,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,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, 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-31 17:08:59,713 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:59,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:59,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:59,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:59,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:08:59,810 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-31 17:08:59,811 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:08:59,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,846 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-31 17:08:59,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:59,886 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-31 17:08:59,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:08:59,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:08:59,924 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-31 17:08:59,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:08:59,976 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-31 17:08:59,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:08:59,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:00,017 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:00,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:00,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:00,070 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-31 17:09:00,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:00,095 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-31 17:09:00,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:00,130 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-31 17:09:00,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:00,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:00,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:00,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:00,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:00,149 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-01-31 17:09:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:01,215 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-01-31 17:09:01,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:01,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:09:01,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:01,217 INFO L225 Difference]: With dead ends: 409 [2019-01-31 17:09:01,217 INFO L226 Difference]: Without dead ends: 397 [2019-01-31 17:09:01,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-31 17:09:01,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-01-31 17:09:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-31 17:09:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-01-31 17:09:01,890 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-01-31 17:09:01,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:01,890 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-01-31 17:09:01,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-01-31 17:09:01,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:01,891 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:01,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:01,891 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:01,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:01,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-01-31 17:09:01,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:01,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:01,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:01,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:02,071 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-31 17:09:02,224 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-31 17:09:02,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:02,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:02,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:02,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:02,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:02,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:02,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:09:02,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:09:02,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:09:02,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:02,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:02,242 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-31 17:09:02,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,246 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-31 17:09:02,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,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, 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-31 17:09:02,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,263 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-31 17:09:02,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,273 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-31 17:09:02,273 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,358 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:02,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,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, 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-31 17:09:02,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,468 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-31 17:09:02,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:02,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,508 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-31 17:09:02,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,556 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-31 17:09:02,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:02,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,595 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:02,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,597 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-31 17:09:02,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,647 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-31 17:09:02,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-31 17:09:02,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,693 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:02,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 40 treesize of output 96 [2019-01-31 17:09:02,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,743 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-31 17:09:02,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:09:02,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:02,786 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:02,787 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-31 17:09:02,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:02,836 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-31 17:09:02,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:09:02,864 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-31 17:09:02,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:02,943 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-31 17:09:02,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:02,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-31 17:09:02,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:02,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:09:02,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:09:02,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:09:02,963 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-01-31 17:09:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:04,952 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-01-31 17:09:04,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:09:04,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-31 17:09:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:04,956 INFO L225 Difference]: With dead ends: 542 [2019-01-31 17:09:04,956 INFO L226 Difference]: Without dead ends: 536 [2019-01-31 17:09:04,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:09:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-31 17:09:05,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-01-31 17:09:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-31 17:09:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-01-31 17:09:05,792 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-01-31 17:09:05,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:05,792 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-01-31 17:09:05,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:09:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-01-31 17:09:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:05,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:05,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:05,793 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:05,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:05,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-01-31 17:09:05,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:05,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:05,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:05,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:05,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:05,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:05,894 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-31 17:09:05,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:05,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:05,895 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:05,895 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-31 17:09:05,895 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:05,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:05,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:05,897 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:09:05,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:05,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:05,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:05,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:05,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:05,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:05,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:05,934 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-31 17:09:05,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,945 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-31 17:09:05,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,948 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-31 17:09:05,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,954 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-31 17:09:05,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:05,962 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-31 17:09:05,962 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:05,991 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:06,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:06,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:06,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:06,045 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-31 17:09:06,046 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:06,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,079 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-31 17:09:06,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:06,120 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-31 17:09:06,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:06,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,159 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-31 17:09:06,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:06,209 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-31 17:09:06,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:06,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:06,249 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:06,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-31 17:09:06,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:06,300 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-31 17:09:06,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:06,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:06,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-31 17:09:06,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:06,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:09:06,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:06,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:06,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:06,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:06,373 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-01-31 17:09:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:07,671 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-01-31 17:09:07,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:07,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:09:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:07,673 INFO L225 Difference]: With dead ends: 469 [2019-01-31 17:09:07,673 INFO L226 Difference]: Without dead ends: 465 [2019-01-31 17:09:07,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:09:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-31 17:09:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-01-31 17:09:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-31 17:09:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-01-31 17:09:08,595 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-01-31 17:09:08,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:08,595 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-01-31 17:09:08,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-01-31 17:09:08,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:08,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:08,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:08,597 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:08,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-01-31 17:09:08,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:08,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:08,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:08,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:08,790 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-31 17:09:08,960 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-31 17:09:08,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:08,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:08,961 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:08,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:08,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:08,961 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:08,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:08,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:08,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:08,979 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-31 17:09:08,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:08,985 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-31 17:09:08,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:08,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:08,994 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-31 17:09:08,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:08,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,000 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-31 17:09:09,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,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, 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-31 17:09:09,008 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,036 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,093 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:09,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:09,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,175 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-31 17:09:09,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:09,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,214 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:09,215 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-31 17:09:09,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,259 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-31 17:09:09,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-01-31 17:09:09,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,299 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-31 17:09:09,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,342 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-31 17:09:09,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-31 17:09:09,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,386 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:09,387 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-31 17:09:09,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,436 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-31 17:09:09,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:09:09,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:09,480 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:09,481 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-31 17:09:09,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:09,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:09,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:09:09,559 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-31 17:09:09,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:09,661 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-31 17:09:09,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:09,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:09:09,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:09,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:09:09,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:09:09,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:09:09,680 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-01-31 17:09:11,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:11,450 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-01-31 17:09:11,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:09:11,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-31 17:09:11,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:11,453 INFO L225 Difference]: With dead ends: 481 [2019-01-31 17:09:11,453 INFO L226 Difference]: Without dead ends: 480 [2019-01-31 17:09:11,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:09:11,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-31 17:09:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-01-31 17:09:11,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-31 17:09:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-01-31 17:09:11,934 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-01-31 17:09:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:11,934 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-01-31 17:09:11,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:09:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-01-31 17:09:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:11,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:11,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:11,935 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:11,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-01-31 17:09:11,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:11,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:11,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:11,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:12,038 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-31 17:09:12,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:12,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:12,039 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:12,039 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-01-31 17:09:12,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:12,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:12,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:12,042 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:09:12,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:12,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:12,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:12,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:12,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:12,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:12,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:12,062 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-31 17:09:12,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:09:12,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-01-31 17:09:12,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-31 17:09:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-31 17:09:12,102 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,117 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,127 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,161 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-31 17:09:12,161 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-31 17:09:12,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,191 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-31 17:09:12,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,207 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-31 17:09:12,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-31 17:09:12,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:12,226 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-31 17:09:12,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:12,247 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-31 17:09:12,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-31 17:09:12,264 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-31 17:09:12,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:12,284 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-31 17:09:12,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:12,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-31 17:09:12,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:12,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:09:12,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:09:12,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:12,305 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-01-31 17:09:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:12,995 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-01-31 17:09:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:09:12,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-31 17:09:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:12,997 INFO L225 Difference]: With dead ends: 267 [2019-01-31 17:09:12,997 INFO L226 Difference]: Without dead ends: 258 [2019-01-31 17:09:12,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:12,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-31 17:09:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-31 17:09:13,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-31 17:09:13,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-01-31 17:09:13,553 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-01-31 17:09:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:13,553 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-01-31 17:09:13,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:09:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-01-31 17:09:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:13,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:13,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:13,554 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:13,554 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-01-31 17:09:13,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:13,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:13,762 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-31 17:09:13,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:13,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:13,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:13,763 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-01-31 17:09:13,763 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:13,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:13,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:13,765 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:09:13,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:13,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:13,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:13,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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:13,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:13,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:13,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:13,782 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-31 17:09:13,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,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, 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-31 17:09:13,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,788 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-31 17:09:13,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,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, 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-31 17:09:13,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,803 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-31 17:09:13,803 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:13,832 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:13,847 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:13,859 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:13,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:13,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:13,889 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:13,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,925 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-31 17:09:13,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:13,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:13,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:13,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-31 17:09:14,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:14,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-31 17:09:14,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:14,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,099 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:14,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 38 treesize of output 94 [2019-01-31 17:09:14,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:14,152 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-31 17:09:14,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:14,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,192 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:14,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:14,194 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-31 17:09:14,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:14,244 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-31 17:09:14,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:09:14,270 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-31 17:09:14,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:14,345 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-31 17:09:14,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:14,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:09:14,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:14,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:14,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:14,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:14,365 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-01-31 17:09:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:15,640 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-01-31 17:09:15,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:15,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:09:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:15,643 INFO L225 Difference]: With dead ends: 309 [2019-01-31 17:09:15,643 INFO L226 Difference]: Without dead ends: 306 [2019-01-31 17:09:15,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:09:15,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-31 17:09:16,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-01-31 17:09:16,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-31 17:09:16,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-01-31 17:09:16,207 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-01-31 17:09:16,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:16,207 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-01-31 17:09:16,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-01-31 17:09:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:16,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:16,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:16,208 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:16,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:16,208 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-01-31 17:09:16,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:16,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:16,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:16,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:16,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:16,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-31 17:09:16,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:16,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:16,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:16,311 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:09:16,312 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:16,312 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:16,314 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:16,315 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:09:16,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:16,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:16,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:16,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:16,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:16,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:16,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:16,336 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-31 17:09:16,343 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-31 17:09:16,349 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-31 17:09:16,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, 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-31 17:09:16,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-31 17:09:16,383 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,397 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,416 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,437 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-31 17:09:16,437 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-31 17:09:16,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,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, 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 21 [2019-01-31 17:09:16,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-31 17:09:16,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:16,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:09:16,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:16,496 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-31 17:09:16,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-31 17:09:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:16,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:16,523 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-31 17:09:16,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:16,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-31 17:09:16,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:16,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:16,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:16,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:09:16,544 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-01-31 17:09:17,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:17,712 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-01-31 17:09:17,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:17,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:09:17,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:17,714 INFO L225 Difference]: With dead ends: 379 [2019-01-31 17:09:17,714 INFO L226 Difference]: Without dead ends: 366 [2019-01-31 17:09:17,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:09:17,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-31 17:09:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-01-31 17:09:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-31 17:09:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-01-31 17:09:18,430 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-01-31 17:09:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:18,431 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-01-31 17:09:18,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-01-31 17:09:18,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:18,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:18,431 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:18,431 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:18,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:18,432 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-01-31 17:09:18,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:18,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:18,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:18,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:18,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:09:18,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:18,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:18,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:18,608 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-01-31 17:09:18,608 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:18,608 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:18,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:18,610 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:09:18,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:18,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:18,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:18,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:18,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:18,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:18,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:18,625 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-31 17:09:18,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, 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-31 17:09:18,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:09:18,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:09:18,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,657 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-31 17:09:18,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,677 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,782 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-31 17:09:18,782 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:09:18,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,827 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-31 17:09:18,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,855 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-31 17:09:18,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:18,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:18,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,918 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-31 17:09:18,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:18,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,946 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:18,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:18,947 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-31 17:09:18,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:18,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:18,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:09:19,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:19,013 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:19,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:19,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:19,047 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-31 17:09:19,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:09:19,068 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-31 17:09:19,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:19,108 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-31 17:09:19,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:19,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-31 17:09:19,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:19,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:19,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:19,129 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-01-31 17:09:20,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:20,851 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-01-31 17:09:20,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:09:20,852 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-31 17:09:20,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:20,854 INFO L225 Difference]: With dead ends: 371 [2019-01-31 17:09:20,855 INFO L226 Difference]: Without dead ends: 366 [2019-01-31 17:09:20,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:09:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-31 17:09:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-01-31 17:09:21,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-31 17:09:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-01-31 17:09:21,733 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-01-31 17:09:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:21,734 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-01-31 17:09:21,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:09:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-01-31 17:09:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:21,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:21,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:21,734 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:21,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-01-31 17:09:21,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:21,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:21,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:21,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:21,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:21,889 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-31 17:09:21,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:21,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:21,889 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:21,890 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-01-31 17:09:21,891 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:21,891 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:21,892 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:21,893 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:09:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:21,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:21,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:21,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:21,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:21,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:21,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:21,910 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-31 17:09:21,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,914 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-31 17:09:21,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,920 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-31 17:09:21,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,928 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-31 17:09:21,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:21,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, 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-31 17:09:21,943 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,970 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:21,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,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-31 17:09:22,025 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:22,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:22,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,107 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-31 17:09:22,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:22,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,145 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:22,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, 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-31 17:09:22,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,188 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-31 17:09:22,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:22,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,228 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-31 17:09:22,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,274 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-31 17:09:22,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:22,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:22,317 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:22,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:22,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:22,366 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-31 17:09:22,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:22,389 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-31 17:09:22,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:22,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:22,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:09:22,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:22,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:22,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:22,454 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-01-31 17:09:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:23,974 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-01-31 17:09:23,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:23,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:09:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:23,976 INFO L225 Difference]: With dead ends: 285 [2019-01-31 17:09:23,977 INFO L226 Difference]: Without dead ends: 284 [2019-01-31 17:09:23,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:09:23,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-31 17:09:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-01-31 17:09:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-31 17:09:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-01-31 17:09:24,861 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-01-31 17:09:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:24,861 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-01-31 17:09:24,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-01-31 17:09:24,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:24,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:24,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:24,862 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:24,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:24,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-01-31 17:09:24,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:24,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:24,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:24,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:24,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:25,013 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-31 17:09:25,066 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-31 17:09:25,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:25,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:25,066 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:25,066 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-31 17:09:25,067 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:25,067 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:25,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:25,069 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:09:25,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:25,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:25,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:25,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:25,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:25,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:25,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:25,086 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-31 17:09:25,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,089 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-31 17:09:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,093 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-31 17:09:25,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,100 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-31 17:09:25,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:25,107 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,135 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,190 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-31 17:09:25,190 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:25,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,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, 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-31 17:09:25,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,268 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-31 17:09:25,268 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:25,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:25,339 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-31 17:09:25,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,383 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-31 17:09:25,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:25,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:25,423 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-31 17:09:25,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:25,471 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-31 17:09:25,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:25,497 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-31 17:09:25,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:25,533 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-31 17:09:25,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:25,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:09:25,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:25,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:25,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:25,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:25,553 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-01-31 17:09:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:26,931 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-01-31 17:09:26,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:26,932 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:09:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:26,933 INFO L225 Difference]: With dead ends: 281 [2019-01-31 17:09:26,933 INFO L226 Difference]: Without dead ends: 274 [2019-01-31 17:09:26,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-31 17:09:27,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-01-31 17:09:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-31 17:09:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-01-31 17:09:27,923 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-01-31 17:09:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:27,923 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-01-31 17:09:27,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-01-31 17:09:27,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:27,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:27,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:27,924 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:27,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-01-31 17:09:27,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:27,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:27,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:27,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:27,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:28,074 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-31 17:09:28,169 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-31 17:09:28,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:28,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:28,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:28,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:28,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:28,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:28,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:09:28,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:09:28,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:09:28,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:28,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:28,189 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-31 17:09:28,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,192 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-31 17:09:28,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,197 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-31 17:09:28,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,202 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-31 17:09:28,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,210 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-31 17:09:28,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,238 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,265 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,294 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-31 17:09:28,294 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:28,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,331 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-31 17:09:28,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,372 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-31 17:09:28,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:28,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,413 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:28,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:28,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,456 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-31 17:09:28,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:28,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,497 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:28,498 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-31 17:09:28,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,544 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-31 17:09:28,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:28,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:28,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, 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-31 17:09:28,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:28,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:28,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:28,652 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-31 17:09:28,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:28,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:28,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:09:28,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:28,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:28,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:28,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:28,738 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-01-31 17:09:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:30,469 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-01-31 17:09:30,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:30,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-31 17:09:30,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:30,471 INFO L225 Difference]: With dead ends: 295 [2019-01-31 17:09:30,471 INFO L226 Difference]: Without dead ends: 288 [2019-01-31 17:09:30,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:09:30,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-31 17:09:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-01-31 17:09:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-31 17:09:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-01-31 17:09:31,464 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-01-31 17:09:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:31,464 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-01-31 17:09:31,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:09:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-01-31 17:09:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:31,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:31,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:31,465 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:31,465 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-01-31 17:09:31,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:31,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:31,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:31,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:31,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:31,622 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:31,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:31,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:31,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:31,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:31,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:31,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:31,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:09:31,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:09:31,648 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:09:31,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:31,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:31,651 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-31 17:09:31,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, 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-31 17:09:31,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:09:31,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,680 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:09:31,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,692 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-31 17:09:31,693 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,726 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,736 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,762 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-31 17:09:31,762 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:09:31,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,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, 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-31 17:09:31,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,832 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-31 17:09:31,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:31,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,867 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-31 17:09:31,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,898 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-31 17:09:31,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:31,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,933 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:31,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, 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-31 17:09:31,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:31,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:31,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:09:31,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:31,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:32,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:32,001 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-31 17:09:32,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:32,036 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-31 17:09:32,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:09:32,059 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-31 17:09:32,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:32,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-31 17:09:32,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:32,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:09:32,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:32,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:32,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:32,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:32,131 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-01-31 17:09:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:34,113 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-01-31 17:09:34,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:34,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-31 17:09:34,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:34,115 INFO L225 Difference]: With dead ends: 370 [2019-01-31 17:09:34,116 INFO L226 Difference]: Without dead ends: 363 [2019-01-31 17:09:34,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:09:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-31 17:09:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-01-31 17:09:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-31 17:09:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-01-31 17:09:35,225 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-01-31 17:09:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:35,225 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-01-31 17:09:35,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:09:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-01-31 17:09:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:35,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:35,225 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:35,226 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:35,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-01-31 17:09:35,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:35,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:35,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:35,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:35,633 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-01-31 17:09:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:35,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:35,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:35,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:35,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:35,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:35,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:35,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:09:35,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:09:35,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:09:35,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:35,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:35,740 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-31 17:09:35,743 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-31 17:09:35,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:09:35,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,757 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:09:35,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:35,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,789 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,837 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-31 17:09:35,837 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:09:35,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,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, 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-31 17:09:35,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,914 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-31 17:09:35,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:35,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:35,947 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:35,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-31 17:09:35,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:35,976 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-31 17:09:35,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:36,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,011 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-31 17:09:36,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,041 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-31 17:09:36,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:36,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,071 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:36,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:36,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-31 17:09:36,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:36,104 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-31 17:09:36,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:09:36,126 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-31 17:09:36,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:36,182 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-31 17:09:36,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:09:36,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:36,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:36,203 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-01-31 17:09:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:38,021 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-01-31 17:09:38,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:38,022 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-31 17:09:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:38,023 INFO L225 Difference]: With dead ends: 349 [2019-01-31 17:09:38,023 INFO L226 Difference]: Without dead ends: 344 [2019-01-31 17:09:38,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:09:38,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-31 17:09:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-01-31 17:09:39,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-31 17:09:39,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-01-31 17:09:39,031 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-01-31 17:09:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:39,031 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-01-31 17:09:39,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:09:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-01-31 17:09:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:39,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:39,031 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:39,031 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-01-31 17:09:39,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:39,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:39,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:39,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:39,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:39,156 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-31 17:09:39,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:39,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:39,157 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:39,157 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-31 17:09:39,157 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:39,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:39,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:39,160 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:09:39,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:39,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:39,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:39,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:39,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:39,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:39,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:39,178 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-31 17:09:39,181 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-31 17:09:39,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:09:39,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,193 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:09:39,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,203 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-31 17:09:39,204 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,244 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,270 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-31 17:09:39,270 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:09:39,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,312 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-31 17:09:39,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,341 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-31 17:09:39,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:39,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,372 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:39,373 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-31 17:09:39,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,401 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-31 17:09:39,402 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:39,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:39,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 31 treesize of output 65 [2019-01-31 17:09:39,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:39,466 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-31 17:09:39,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:39,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:39,521 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-31 17:09:39,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:39,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:09:39,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:39,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:39,540 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-01-31 17:09:40,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:40,980 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-01-31 17:09:40,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:40,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:09:40,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:40,981 INFO L225 Difference]: With dead ends: 257 [2019-01-31 17:09:40,981 INFO L226 Difference]: Without dead ends: 250 [2019-01-31 17:09:40,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-31 17:09:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-01-31 17:09:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-31 17:09:41,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-01-31 17:09:41,985 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-01-31 17:09:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:41,985 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-01-31 17:09:41,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-01-31 17:09:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:41,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:41,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:41,986 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:41,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:41,986 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-01-31 17:09:41,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:41,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:41,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:41,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:42,179 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-31 17:09:42,244 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-31 17:09:42,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:42,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:42,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:42,244 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-01-31 17:09:42,245 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:42,245 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:42,246 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:42,246 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:09:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:42,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:42,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:42,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:42,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:42,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:42,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:42,278 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-31 17:09:42,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,287 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-31 17:09:42,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,290 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-31 17:09:42,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,297 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-31 17:09:42,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,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, 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-31 17:09:42,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,335 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,390 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-31 17:09:42,391 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:42,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:42,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,466 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-31 17:09:42,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:42,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,509 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-31 17:09:42,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,557 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-31 17:09:42,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:42,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,596 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:42,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,598 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-31 17:09:42,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,649 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-31 17:09:42,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:09:42,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:42,694 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:42,695 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 106 [2019-01-31 17:09:42,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:42,755 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-31 17:09:42,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:09:42,780 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-31 17:09:42,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:42,839 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-31 17:09:42,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:42,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:09:42,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:42,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:09:42,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:09:42,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:42,859 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-01-31 17:09:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:44,816 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-01-31 17:09:44,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:44,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-31 17:09:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:44,818 INFO L225 Difference]: With dead ends: 316 [2019-01-31 17:09:44,818 INFO L226 Difference]: Without dead ends: 315 [2019-01-31 17:09:44,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:09:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-31 17:09:45,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-01-31 17:09:45,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-31 17:09:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-01-31 17:09:45,847 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-01-31 17:09:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:45,848 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-01-31 17:09:45,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:09:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-01-31 17:09:45,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:45,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:45,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:45,848 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:45,849 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-01-31 17:09:45,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:45,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:45,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:45,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:45,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:45,983 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-31 17:09:45,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:45,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:45,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:45,984 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-31 17:09:45,985 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:45,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:45,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:45,987 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:09:45,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:45,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:45,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:45,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:46,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:46,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:46,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:46,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-31 17:09:46,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-01-31 17:09:46,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,093 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-31 17:09:46,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,098 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-31 17:09:46,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,104 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-31 17:09:46,105 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,147 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,189 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-31 17:09:46,189 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:46,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,441 INFO L303 Elim1Store]: Index analysis took 232 ms [2019-01-31 17:09:46,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:46,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,484 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-31 17:09:46,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:46,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,518 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:46,519 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-31 17:09:46,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,559 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-31 17:09:46,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:46,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:46,598 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:46,598 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-31 17:09:46,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:46,643 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-31 17:09:46,644 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:46,669 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-31 17:09:46,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:46,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:46,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:46,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:09:46,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:46,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:46,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:46,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:46,724 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-01-31 17:09:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:48,182 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-01-31 17:09:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:48,182 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:09:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:48,183 INFO L225 Difference]: With dead ends: 253 [2019-01-31 17:09:48,183 INFO L226 Difference]: Without dead ends: 246 [2019-01-31 17:09:48,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-31 17:09:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-01-31 17:09:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-31 17:09:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-01-31 17:09:49,255 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-01-31 17:09:49,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:49,255 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-01-31 17:09:49,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-01-31 17:09:49,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:49,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:49,256 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:49,256 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-01-31 17:09:49,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:49,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:49,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:49,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:49,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:49,473 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-31 17:09:49,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:49,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:49,474 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:09:49,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:09:49,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:49,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:49,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:09:49,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:09:49,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:09:49,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:09:49,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:49,494 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-31 17:09:49,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,498 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-31 17:09:49,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,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, 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-31 17:09:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,511 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-31 17:09:49,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,518 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-31 17:09:49,518 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,545 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,599 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-31 17:09:49,599 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:49,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,638 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-31 17:09:49,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,680 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-31 17:09:49,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:49,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,724 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-31 17:09:49,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,772 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-31 17:09:49,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:49,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,814 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:49,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:09:49,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,865 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-31 17:09:49,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:49,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:49,917 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:49,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-31 17:09:49,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:49,970 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-31 17:09:49,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:09:49,999 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-31 17:09:49,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:50,064 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-31 17:09:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:50,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:09:50,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:09:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:09:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:50,082 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-01-31 17:09:52,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:52,221 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-01-31 17:09:52,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:09:52,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-31 17:09:52,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:52,223 INFO L225 Difference]: With dead ends: 332 [2019-01-31 17:09:52,223 INFO L226 Difference]: Without dead ends: 328 [2019-01-31 17:09:52,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:09:52,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-31 17:09:53,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-01-31 17:09:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-31 17:09:53,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-01-31 17:09:53,212 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-01-31 17:09:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:53,212 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-01-31 17:09:53,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:09:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-01-31 17:09:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:53,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:53,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:53,213 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:53,213 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-01-31 17:09:53,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:53,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:09:53,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:53,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:53,377 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-31 17:09:53,423 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-31 17:09:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:53,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:53,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:53,424 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-31 17:09:53,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:53,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:53,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:53,426 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:09:53,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:53,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:53,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:53,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:53,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:53,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:53,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:53,444 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-31 17:09:53,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,447 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-31 17:09:53,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,452 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-31 17:09:53,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,458 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-31 17:09:53,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,465 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-31 17:09:53,465 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,521 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,550 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-31 17:09:53,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:09:53,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,585 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-31 17:09:53,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,635 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-31 17:09:53,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:53,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,671 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:53,672 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-31 17:09:53,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:53,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:53,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:53,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09: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, 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-31 17:09:53,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:53,800 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-31 17:09:53,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-31 17:09:53,826 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-31 17:09:53,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:53,861 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-31 17:09:53,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:53,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:09:53,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:53,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:09:53,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:09:53,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:09:53,879 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-01-31 17:09:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:55,347 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-01-31 17:09:55,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:09:55,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-31 17:09:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:55,349 INFO L225 Difference]: With dead ends: 242 [2019-01-31 17:09:55,349 INFO L226 Difference]: Without dead ends: 241 [2019-01-31 17:09:55,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:09:55,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-31 17:09:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-31 17:09:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-31 17:09:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-01-31 17:09:56,397 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-01-31 17:09:56,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:56,397 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-01-31 17:09:56,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:09:56,397 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-01-31 17:09:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:56,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:56,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:56,397 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:56,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:56,398 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-01-31 17:09:56,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:56,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:56,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:56,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:56,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:56,547 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-31 17:09:56,607 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-31 17:09:56,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:56,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:09:56,608 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:09:56,608 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-31 17:09:56,609 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:09:56,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:09:56,611 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:09:56,611 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:09:56,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:56,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:09:56,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:09:56,612 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:09:56,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:56,622 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:09:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:09:56,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:09:56,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, 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-31 17:09:56,653 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-31 17:09:56,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:09:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09: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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:09:56,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,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, 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-31 17:09:56,681 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,701 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,754 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-31 17:09:56,754 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:09:56,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-31 17:09:56,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,822 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-31 17:09:56,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:09:56,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,849 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:09:56,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:56,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:56,875 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-31 17:09:56,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:09:56,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:56,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:09:57,005 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-31 17:09:57,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:09:57,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:09:57,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:09:57,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:09:57,057 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-31 17:09:57,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:09:57,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:09:57,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:09:57,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:09:57,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:09:57,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:09:57,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:09:57,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:09:57,115 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-01-31 17:09:58,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:09:58,657 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-01-31 17:09:58,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:09:58,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:09:58,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:09:58,659 INFO L225 Difference]: With dead ends: 254 [2019-01-31 17:09:58,659 INFO L226 Difference]: Without dead ends: 245 [2019-01-31 17:09:58,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:09:58,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-31 17:09:59,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-01-31 17:09:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-31 17:09:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-01-31 17:09:59,749 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-01-31 17:09:59,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:09:59,749 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-01-31 17:09:59,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:09:59,749 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-01-31 17:09:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:09:59,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:09:59,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:09:59,750 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:09:59,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:09:59,750 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-01-31 17:09:59,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:09:59,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:59,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:09:59,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:09:59,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:09:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:00,168 WARN L181 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-31 17:10:00,357 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-01-31 17:10:00,394 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-31 17:10:00,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:00,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:00,395 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:10:00,395 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-01-31 17:10:00,395 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:00,395 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:00,397 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:00,397 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:10:00,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:00,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:00,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:00,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:00,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:00,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:00,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:00,413 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-31 17:10:00,415 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-31 17:10:00,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:10:00,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,427 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:10:00,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,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, 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-31 17:10:00,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,458 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,470 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,507 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-31 17:10:00,507 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:10:00,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,548 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-31 17:10:00,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,573 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-31 17:10:00,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:00,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,603 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:00,604 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-31 17:10:00,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,633 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-31 17:10:00,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:10:00,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:00,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 69 [2019-01-31 17:10:00,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:00,705 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-31 17:10:00,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:10:00,725 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-31 17:10:00,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:00,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:00,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-31 17:10:00,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:00,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:10:00,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:10:00,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:10:00,779 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-01-31 17:10:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:02,295 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-01-31 17:10:02,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:10:02,296 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-31 17:10:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:02,297 INFO L225 Difference]: With dead ends: 249 [2019-01-31 17:10:02,297 INFO L226 Difference]: Without dead ends: 248 [2019-01-31 17:10:02,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:02,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-31 17:10:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-01-31 17:10:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-31 17:10:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-01-31 17:10:03,418 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-01-31 17:10:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:03,418 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-01-31 17:10:03,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:10:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-01-31 17:10:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:10:03,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:03,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:03,419 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:03,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:03,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-01-31 17:10:03,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:03,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:03,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:03,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:03,498 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-31 17:10:03,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:03,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:03,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:10:03,499 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-01-31 17:10:03,500 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:03,500 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:03,501 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:03,501 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:10:03,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:03,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:03,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:03,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:03,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:03,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:03,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:03,521 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-31 17:10:03,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,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, 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-31 17:10:03,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:10:03,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,537 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-31 17:10:03,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,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, 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-31 17:10:03,547 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:03,575 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:03,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:03,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:03,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:03,630 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-31 17:10:03,630 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:03,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,659 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-31 17:10:03,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:03,699 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-31 17:10:03,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:03,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:03,732 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-31 17:10:03,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:03,777 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-31 17:10:03,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:03,808 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-31 17:10:03,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:03,892 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-31 17:10:03,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:03,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:10:03,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:03,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:10:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:10:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:10:03,912 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-01-31 17:10:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:05,254 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-01-31 17:10:05,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:10:05,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-31 17:10:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:05,256 INFO L225 Difference]: With dead ends: 239 [2019-01-31 17:10:05,256 INFO L226 Difference]: Without dead ends: 230 [2019-01-31 17:10:05,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:10:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-31 17:10:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-31 17:10:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-31 17:10:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-01-31 17:10:06,340 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-01-31 17:10:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:06,340 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-01-31 17:10:06,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:10:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-01-31 17:10:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-31 17:10:06,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:06,340 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:06,341 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:06,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:06,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-31 17:10:06,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:06,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:06,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:06,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:06,412 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-31 17:10:06,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:06,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:06,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-31 17:10:06,413 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-01-31 17:10:06,413 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:06,413 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:06,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:06,416 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:10:06,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:06,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:06,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:06,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:06,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:06,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:06,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:06,433 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-31 17:10:06,437 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-31 17:10:06,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:10:06,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,461 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:10:06,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,481 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-31 17:10:06,482 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:06,501 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:06,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:06,523 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:06,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:06,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-31 17:10:06,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:10:06,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,590 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-31 17:10:06,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:06,617 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-31 17:10:06,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:06,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:06,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, 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-31 17:10:06,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:06,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:06,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:10:06,696 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-31 17:10:06,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:06,714 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-31 17:10:06,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:06,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:10:06,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:06,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:10:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:10:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:10:06,732 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-01-31 17:10:07,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:07,997 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-01-31 17:10:07,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:10:07,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-31 17:10:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:07,999 INFO L225 Difference]: With dead ends: 236 [2019-01-31 17:10:07,999 INFO L226 Difference]: Without dead ends: 227 [2019-01-31 17:10:07,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:10:07,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-31 17:10:09,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-31 17:10:09,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-31 17:10:09,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-01-31 17:10:09,109 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-01-31 17:10:09,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:09,109 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-01-31 17:10:09,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:10:09,109 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-01-31 17:10:09,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:09,110 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:09,110 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:09,110 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:09,110 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-01-31 17:10:09,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:09,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:09,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:09,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:09,262 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-31 17:10:09,296 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-31 17:10:09,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:09,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:09,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:09,297 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-01-31 17:10:09,297 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:09,297 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:09,299 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:09,299 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:10:09,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:09,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:09,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:09,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:09,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:09,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:09,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:09,316 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-31 17:10:09,319 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-31 17:10:09,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:10:09,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,331 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:10:09,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,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, 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-31 17:10:09,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,362 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,411 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-31 17:10:09,411 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:10:09,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,450 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-31 17:10:09,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,478 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-31 17:10:09,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:09,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,506 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 57 [2019-01-31 17:10:09,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,538 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-31 17:10:09,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:10:09,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:09,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:10:09,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:09,601 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-31 17:10:09,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-31 17:10:09,626 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-31 17:10:09,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:09,657 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-31 17:10:09,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:09,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:10:09,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:09,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:10:09,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:10:09,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:10:09,678 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-01-31 17:10:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:10,984 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-01-31 17:10:10,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:10,985 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-31 17:10:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:10,986 INFO L225 Difference]: With dead ends: 236 [2019-01-31 17:10:10,986 INFO L226 Difference]: Without dead ends: 227 [2019-01-31 17:10:10,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:10:10,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-31 17:10:12,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-01-31 17:10:12,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-31 17:10:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-01-31 17:10:12,086 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-01-31 17:10:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:12,086 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-01-31 17:10:12,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:10:12,086 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-01-31 17:10:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:12,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:12,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:12,087 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:12,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-01-31 17:10:12,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:12,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:12,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:12,088 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:12,254 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-31 17:10:12,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:12,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:12,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:12,254 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:10:12,255 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:12,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:12,256 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:12,256 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:10:12,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:12,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:12,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:12,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:12,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:12,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:12,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:12,276 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-31 17:10:12,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,278 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-31 17:10:12,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,288 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-31 17:10:12,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,363 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-31 17:10:12,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,460 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-31 17:10:12,461 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,545 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-31 17:10:12,545 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:12,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,584 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-31 17:10:12,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,623 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-31 17:10:12,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:12,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,662 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-31 17:10:12,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,709 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-31 17:10:12,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:12,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,747 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:12,748 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-31 17:10:12,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,798 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-31 17:10:12,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:12,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:12,843 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:12,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, 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-31 17:10:12,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:12,894 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-31 17:10:12,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:12,923 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-31 17:10:12,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:12,972 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-31 17:10:12,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:12,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:10:12,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:12,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:10:12,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:10:12,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:10:12,993 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-01-31 17:10:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:15,108 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-01-31 17:10:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:10:15,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:10:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:15,110 INFO L225 Difference]: With dead ends: 326 [2019-01-31 17:10:15,110 INFO L226 Difference]: Without dead ends: 316 [2019-01-31 17:10:15,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-31 17:10:15,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-01-31 17:10:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-01-31 17:10:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-31 17:10:16,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-01-31 17:10:16,259 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-01-31 17:10:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:16,260 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-01-31 17:10:16,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:10:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-01-31 17:10:16,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:16,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:16,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:16,260 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:16,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:16,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-01-31 17:10:16,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:16,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:16,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:16,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:16,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:16,379 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-31 17:10:16,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:16,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:16,380 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:16,380 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-31 17:10:16,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:16,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:16,383 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:16,383 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:10:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:16,384 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:16,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:16,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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:16,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:16,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:16,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:16,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, 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-31 17:10:16,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, 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-31 17:10:16,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:10:16,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,423 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:10:16,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,438 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-31 17:10:16,439 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,483 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,509 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-31 17:10:16,510 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:10:16,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:10:16,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,573 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-31 17:10:16,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:16,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,597 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:16,598 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-31 17:10:16,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,628 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-31 17:10:16,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:10:16,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:16,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:10:16,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:16,689 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-31 17:10:16,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:10:16,710 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-31 17:10:16,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:16,733 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-31 17:10:16,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:16,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-31 17:10:16,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:16,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-31 17:10:16,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-31 17:10:16,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:10:16,753 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-01-31 17:10:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:18,695 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-01-31 17:10:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:10:18,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-31 17:10:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:18,697 INFO L225 Difference]: With dead ends: 288 [2019-01-31 17:10:18,697 INFO L226 Difference]: Without dead ends: 279 [2019-01-31 17:10:18,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-31 17:10:20,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-01-31 17:10:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-31 17:10:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-01-31 17:10:20,271 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-01-31 17:10:20,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:20,271 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-01-31 17:10:20,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-31 17:10:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-01-31 17:10:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:20,272 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:20,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:20,272 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:20,273 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-31 17:10:20,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:20,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:20,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:20,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:20,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:20,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:20,433 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-31 17:10:20,478 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-31 17:10:20,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:20,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:20,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:20,479 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-31 17:10:20,480 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:20,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:20,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:20,482 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:10:20,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:20,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:20,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:20,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:20,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:20,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:20,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:20,499 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-31 17:10:20,504 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-31 17:10:20,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:10:20,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10: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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:10:20,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,527 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-31 17:10:20,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,548 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,596 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-31 17:10:20,596 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:10:20,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:10:20,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,663 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-31 17:10:20,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:20,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,694 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-31 17:10:20,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,721 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-31 17:10:20,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:10:20,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,753 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:20,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:20,754 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-31 17:10:20,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:20,790 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-31 17:10:20,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:10:20,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:20,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:20,849 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-31 17:10:20,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:20,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:10:20,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:20,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:10:20,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:10:20,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:10:20,867 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-01-31 17:10:22,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:22,856 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-01-31 17:10:22,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:22,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-31 17:10:22,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:22,858 INFO L225 Difference]: With dead ends: 277 [2019-01-31 17:10:22,858 INFO L226 Difference]: Without dead ends: 268 [2019-01-31 17:10:22,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-31 17:10:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-01-31 17:10:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-31 17:10:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-01-31 17:10:24,486 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-01-31 17:10:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:24,486 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-01-31 17:10:24,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:10:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-01-31 17:10:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:24,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:24,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:24,487 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-01-31 17:10:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:24,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:24,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:24,683 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-31 17:10:24,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:24,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:24,684 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:24,684 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-01-31 17:10:24,684 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:24,684 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:24,686 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:24,686 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:10:24,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:24,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:24,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:24,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:24,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:24,694 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:24,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:24,702 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-31 17:10:24,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,705 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-31 17:10:24,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,711 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-31 17:10:24,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,717 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-31 17:10:24,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,725 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-31 17:10:24,726 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,754 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,769 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,808 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:24,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:10:24,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,888 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-31 17:10:24,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:24,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:24,934 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:24,934 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-31 17:10:24,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:24,980 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-31 17:10:24,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:25,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:25,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:25,070 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-31 17:10:25,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:25,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:25,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:25,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:25,164 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-31 17:10:25,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:10:25,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:25,215 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:25,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:25,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:25,266 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-31 17:10:25,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:10:25,291 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-31 17:10:25,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:25,369 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-31 17:10:25,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:25,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-31 17:10:25,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:25,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:10:25,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:10:25,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:10:25,388 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-01-31 17:10:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:28,373 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-01-31 17:10:28,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:10:28,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-31 17:10:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:28,375 INFO L225 Difference]: With dead ends: 361 [2019-01-31 17:10:28,375 INFO L226 Difference]: Without dead ends: 356 [2019-01-31 17:10:28,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:10:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-31 17:10:30,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-01-31 17:10:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-31 17:10:30,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-01-31 17:10:30,090 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-01-31 17:10:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:30,090 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-01-31 17:10:30,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:10:30,090 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-01-31 17:10:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:30,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:30,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:30,091 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:30,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:30,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-01-31 17:10:30,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:30,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:30,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:30,296 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-31 17:10:30,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:30,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:30,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:10:30,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:10:30,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:30,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:30,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:10:30,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:10:30,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:10:30,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:10:30,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:30,319 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-31 17:10:30,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,322 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-31 17:10:30,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,326 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-31 17:10:30,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,332 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-31 17:10:30,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,341 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-31 17:10:30,342 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:30,368 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:30,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:30,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:30,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:30,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:30,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:30,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:30,465 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-31 17:10:30,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:30,982 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-31 17:10:30,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:31,265 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-31 17:10:31,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:31,572 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:31,572 INFO L303 Elim1Store]: Index analysis took 303 ms [2019-01-31 17:10:31,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:31,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:32,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:10:32,025 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:32,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,071 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-31 17:10:32,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:32,113 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-31 17:10:32,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:32,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,156 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:32,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-31 17:10:32,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:32,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-31 17:10:32,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,243 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:32,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:32,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 93 [2019-01-31 17:10:32,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:32,296 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-31 17:10:32,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:10:32,323 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-31 17:10:32,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:32,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:32,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-31 17:10:32,419 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:32,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:10:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:10:32,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:10:32,419 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-01-31 17:10:35,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:35,303 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-01-31 17:10:35,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:10:35,304 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-31 17:10:35,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:35,305 INFO L225 Difference]: With dead ends: 357 [2019-01-31 17:10:35,305 INFO L226 Difference]: Without dead ends: 352 [2019-01-31 17:10:35,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:10:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-31 17:10:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-01-31 17:10:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-31 17:10:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-01-31 17:10:36,810 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-01-31 17:10:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:36,810 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-01-31 17:10:36,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:10:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-01-31 17:10:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:36,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:36,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:36,811 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:36,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-01-31 17:10:36,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:36,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:36,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:10:36,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:36,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:37,048 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-31 17:10:37,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:37,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:37,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:10:37,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:10:37,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:37,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:37,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:10:37,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:10:37,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:10:37,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:10:37,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:37,094 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-31 17:10:37,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,097 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-31 17:10:37,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:10:37,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:10:37,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,113 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-31 17:10:37,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,142 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,169 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,198 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:37,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,235 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-31 17:10:37,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,277 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-31 17:10:37,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:37,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,315 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:37,316 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-31 17:10:37,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,369 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-31 17:10:37,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,411 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-31 17:10:37,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,461 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-31 17:10:37,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:37,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,503 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:37,504 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-31 17:10:37,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,554 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-31 17:10:37,554 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:37,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:37,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:37,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-01-31 17:10:37,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:37,654 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-31 17:10:37,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:37,681 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-31 17:10:37,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:37,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:37,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:10:37,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:37,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:10:37,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:10:37,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:10:37,785 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-01-31 17:10:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:40,075 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-01-31 17:10:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:10:40,076 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-01-31 17:10:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:40,077 INFO L225 Difference]: With dead ends: 260 [2019-01-31 17:10:40,077 INFO L226 Difference]: Without dead ends: 253 [2019-01-31 17:10:40,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-31 17:10:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-31 17:10:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-01-31 17:10:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-31 17:10:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-01-31 17:10:41,139 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-01-31 17:10:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:41,139 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-01-31 17:10:41,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:10:41,139 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-01-31 17:10:41,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:41,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:41,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:41,140 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:41,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:41,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-01-31 17:10:41,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:41,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:41,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:10:41,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:41,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:41,300 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-31 17:10:41,387 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-31 17:10:41,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:41,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:41,388 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:41,388 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:10:41,389 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:41,389 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:41,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:41,390 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:10:41,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:41,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:41,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:41,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:41,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:41,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:41,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:41,411 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-31 17:10:41,413 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-31 17:10:41,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:10:41,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:10:41,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,435 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-31 17:10:41,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,477 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,504 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-31 17:10:41,504 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:10:41,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,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 51 [2019-01-31 17:10:41,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,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-31 17:10:41,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:41,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:10:41,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,645 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-31 17:10:41,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:41,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,685 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:41,686 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-31 17:10:41,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,720 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-31 17:10:41,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:10:41,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:41,754 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:41,754 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-31 17:10:41,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:41,789 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-31 17:10:41,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:10:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:10:41,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:41,869 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-31 17:10:41,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:41,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:10:41,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:41,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:10:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:10:41,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:10:41,889 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-01-31 17:10:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:43,734 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-01-31 17:10:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:10:43,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:10:43,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:43,735 INFO L225 Difference]: With dead ends: 202 [2019-01-31 17:10:43,735 INFO L226 Difference]: Without dead ends: 195 [2019-01-31 17:10:43,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:10:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-31 17:10:44,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-01-31 17:10:44,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-31 17:10:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-01-31 17:10:44,936 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-01-31 17:10:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:44,936 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-01-31 17:10:44,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:10:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-01-31 17:10:44,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:44,936 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:44,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:44,937 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:44,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:44,937 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-01-31 17:10:44,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:44,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:44,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:44,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:45,133 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-31 17:10:45,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:45,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:45,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:45,134 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-31 17:10:45,134 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:45,135 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:45,137 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:45,137 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:10:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:45,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:45,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:45,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:45,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:45,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:45,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:45,156 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-31 17:10:45,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,163 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-31 17:10:45,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:10:45,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,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, 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-31 17:10:45,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,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, 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-31 17:10:45,303 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,340 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,367 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,396 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:45,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,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 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-31 17:10:45,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,477 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-31 17:10:45,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:45,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,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 36 treesize of output 86 [2019-01-31 17:10:45,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,581 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-31 17:10:45,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:45,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,620 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:45,621 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-31 17:10:45,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,671 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-31 17:10:45,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:45,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:45,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:45,715 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-31 17:10:45,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:45,766 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-31 17:10:45,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:45,794 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-31 17:10:45,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:45,849 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-31 17:10:45,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:45,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:10:45,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:45,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:10:45,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:10:45,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:45,868 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-01-31 17:10:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:47,791 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-01-31 17:10:47,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:10:47,791 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:10:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:47,792 INFO L225 Difference]: With dead ends: 199 [2019-01-31 17:10:47,792 INFO L226 Difference]: Without dead ends: 192 [2019-01-31 17:10:47,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:10:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-31 17:10:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-01-31 17:10:48,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-31 17:10:48,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-01-31 17:10:48,946 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-01-31 17:10:48,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:48,946 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-01-31 17:10:48,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:10:48,946 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-01-31 17:10:48,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:48,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:48,946 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:48,946 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:48,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-31 17:10:48,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:48,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:48,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:48,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:49,013 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-31 17:10:49,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:49,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:49,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:49,014 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-31 17:10:49,015 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:49,015 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:49,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:49,017 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:10:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:49,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:49,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:49,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:49,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:49,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:49,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:49,040 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-31 17:10:49,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, 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-31 17:10:49,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:10:49,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,064 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:10:49,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,075 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-31 17:10:49,075 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,141 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-31 17:10:49,141 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-31 17:10:49,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,177 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-31 17:10:49,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,204 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-31 17:10:49,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:49,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,230 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-31 17:10:49,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,262 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-31 17:10:49,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:10:49,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:49,294 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-31 17:10:49,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:49,331 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-31 17:10:49,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:10:49,351 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-31 17:10:49,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:49,376 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-31 17:10:49,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:49,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-31 17:10:49,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:49,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-31 17:10:49,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-31 17:10:49,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-31 17:10:49,397 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-01-31 17:10:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:51,041 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-01-31 17:10:51,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:10:51,042 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-31 17:10:51,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:51,043 INFO L225 Difference]: With dead ends: 196 [2019-01-31 17:10:51,043 INFO L226 Difference]: Without dead ends: 187 [2019-01-31 17:10:51,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:10:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-31 17:10:52,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-31 17:10:52,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-31 17:10:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-01-31 17:10:52,420 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-01-31 17:10:52,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:52,420 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-01-31 17:10:52,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-31 17:10:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-01-31 17:10:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:52,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:52,420 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:52,420 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-31 17:10:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:52,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:52,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:52,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:52,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:52,533 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-31 17:10:52,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:52,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:52,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:52,534 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-31 17:10:52,534 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:52,534 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:52,536 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:52,536 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:10:52,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:52,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:52,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:52,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:52,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:52,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:52,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:52,585 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-31 17:10:52,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,627 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-31 17:10:52,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-31 17:10:52,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-31 17:10:52,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,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, 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-31 17:10:52,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,695 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,721 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,750 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-31 17:10:52,750 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:52,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,784 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-31 17:10:52,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,827 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-31 17:10:52,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:52,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,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, 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-31 17:10:52,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,909 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-31 17:10:52,909 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:52,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,943 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:52,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:52,945 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-31 17:10:52,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:52,995 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-31 17:10:52,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-31 17:10:53,035 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-31 17:10:53,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:53,066 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-31 17:10:53,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:53,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-31 17:10:53,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:53,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:10:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:10:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:10:53,084 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-01-31 17:10:53,700 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-31 17:10:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:10:55,353 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-01-31 17:10:55,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:10:55,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-31 17:10:55,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:10:55,354 INFO L225 Difference]: With dead ends: 203 [2019-01-31 17:10:55,355 INFO L226 Difference]: Without dead ends: 194 [2019-01-31 17:10:55,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:10:55,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-31 17:10:56,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-01-31 17:10:56,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-31 17:10:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-01-31 17:10:56,846 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-01-31 17:10:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:10:56,847 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-01-31 17:10:56,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:10:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-01-31 17:10:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:10:56,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:10:56,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:10:56,847 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:10:56,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-01-31 17:10:56,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:10:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:56,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:56,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:10:56,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:10:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:10:56,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:56,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:10:56,984 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:10:56,984 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-31 17:10:56,985 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:10:56,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:10:56,987 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:10:56,987 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:10:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:10:56,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:10:56,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:10:56,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:10:56,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:10:56,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:10:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:10:57,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:10:57,007 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-31 17:10:57,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-31 17:10:57,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,016 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-31 17:10:57,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,028 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-31 17:10:57,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,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, 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-31 17:10:57,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,064 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,089 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,118 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-31 17:10:57,118 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:10:57,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,156 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-31 17:10:57,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,201 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-31 17:10:57,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:57,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:10:57,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,291 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-31 17:10:57,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:10:57,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,335 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:57,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 99 [2019-01-31 17:10:57,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,387 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-31 17:10:57,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:10:57,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:10:57,425 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:10:57,425 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-31 17:10:57,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:10:57,473 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-31 17:10:57,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:10:57,497 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-31 17:10:57,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:10:57,543 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-31 17:10:57,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:10:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:10:57,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:10:57,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:10:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:10:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:10:57,562 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-01-31 17:11:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:00,147 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-01-31 17:11:00,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:00,148 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:11:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:00,149 INFO L225 Difference]: With dead ends: 269 [2019-01-31 17:11:00,149 INFO L226 Difference]: Without dead ends: 265 [2019-01-31 17:11:00,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:00,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-31 17:11:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-01-31 17:11:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-31 17:11:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-01-31 17:11:01,968 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-01-31 17:11:01,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:01,968 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-01-31 17:11:01,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:11:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-01-31 17:11:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:11:01,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:01,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:01,968 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-01-31 17:11:01,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:01,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:01,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:01,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:02,115 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-31 17:11:02,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:02,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:02,115 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:11:02,116 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-01-31 17:11:02,116 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:02,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:02,117 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:02,117 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-31 17:11:02,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:02,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:02,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:02,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:02,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:02,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:02,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:02,135 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-31 17:11:02,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,138 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-31 17:11:02,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,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 23 treesize of output 37 [2019-01-31 17:11:02,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,151 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-31 17:11:02,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,159 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-31 17:11:02,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,246 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-31 17:11:02,246 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:02,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,284 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-31 17:11:02,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,327 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-31 17:11:02,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:02,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,371 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-31 17:11:02,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,418 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-31 17:11:02,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:02,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,460 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:02,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 99 [2019-01-31 17:11:02,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,511 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-31 17:11:02,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:02,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:02,553 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:02,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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 106 [2019-01-31 17:11:02,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:02,614 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-31 17:11:02,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:02,638 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-31 17:11:02,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:02,686 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-31 17:11:02,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:02,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-31 17:11:02,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:02,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:11:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:11:02,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-31 17:11:02,705 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-01-31 17:11:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:05,294 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-01-31 17:11:05,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:05,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-31 17:11:05,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:05,295 INFO L225 Difference]: With dead ends: 253 [2019-01-31 17:11:05,295 INFO L226 Difference]: Without dead ends: 249 [2019-01-31 17:11:05,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:05,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-31 17:11:07,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-01-31 17:11:07,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-31 17:11:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-01-31 17:11:07,111 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-01-31 17:11:07,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:07,111 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-01-31 17:11:07,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:11:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-01-31 17:11:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:11:07,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:07,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:07,112 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:07,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-01-31 17:11:07,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:07,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:07,206 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-31 17:11:07,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:07,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:07,207 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:11:07,207 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-01-31 17:11:07,207 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:07,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:07,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:07,209 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:11:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:07,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:07,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:07,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:07,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:07,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:07,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:07,232 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-31 17:11:07,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,235 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-31 17:11:07,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,240 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-31 17:11:07,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:11:07,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,256 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-31 17:11:07,257 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,285 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,300 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,341 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-31 17:11:07,341 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:07,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:07,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,419 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-31 17:11:07,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:07,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:07,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,508 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-31 17:11:07,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:07,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:07,546 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:07,547 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-31 17:11:07,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:07,596 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-31 17:11:07,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:07,634 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-31 17:11:07,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:07,667 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-31 17:11:07,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:07,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-31 17:11:07,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:07,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:11:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:11:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-31 17:11:07,686 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-01-31 17:11:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:09,895 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-01-31 17:11:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:11:09,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-31 17:11:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:09,897 INFO L225 Difference]: With dead ends: 226 [2019-01-31 17:11:09,897 INFO L226 Difference]: Without dead ends: 217 [2019-01-31 17:11:09,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:11:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-31 17:11:11,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-01-31 17:11:11,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-31 17:11:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-01-31 17:11:11,714 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-01-31 17:11:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:11,714 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-01-31 17:11:11,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:11:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-01-31 17:11:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:11:11,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:11,715 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:11,715 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:11,715 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-01-31 17:11:11,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:11,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:11,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:11,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:11,936 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-31 17:11:12,058 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-31 17:11:12,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:12,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:12,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:12,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:12,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:12,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:12,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:11:12,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:11:12,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:11:12,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:12,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:12,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, 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-31 17:11:12,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,082 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-31 17:11:12,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,085 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-31 17:11:12,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,090 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-31 17:11:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,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, 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-31 17:11:12,097 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,126 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,181 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-31 17:11:12,181 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:12,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,226 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-31 17:11:12,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,271 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-31 17:11:12,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:12,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,307 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:12,308 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-31 17:11:12,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,353 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-31 17:11:12,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:12,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,392 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-31 17:11:12,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,438 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-31 17:11:12,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:12,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:12,483 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:12,483 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-31 17:11:12,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:12,535 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-31 17:11:12,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:12,567 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-31 17:11:12,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:12,635 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-31 17:11:12,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:12,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:11:12,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:12,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:12,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:12,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:12,654 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-01-31 17:11:15,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:15,344 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-01-31 17:11:15,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:15,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:11:15,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:15,345 INFO L225 Difference]: With dead ends: 258 [2019-01-31 17:11:15,346 INFO L226 Difference]: Without dead ends: 251 [2019-01-31 17:11:15,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-31 17:11:15,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-31 17:11:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-01-31 17:11:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-31 17:11:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-01-31 17:11:17,133 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-01-31 17:11:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:17,133 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-01-31 17:11:17,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:17,133 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-01-31 17:11:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:11:17,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:17,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:17,134 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-01-31 17:11:17,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:17,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:17,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:17,316 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-31 17:11:17,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:17,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:17,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:17,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:17,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:17,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:17,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:11:17,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:11:17,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:11:17,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:17,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:17,335 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-31 17:11:17,339 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-31 17:11:17,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:11:17,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:11:17,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,371 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-31 17:11:17,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,390 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,438 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-31 17:11:17,438 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-31 17:11:17,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:17,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,507 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-31 17:11:17,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-31 17:11:17,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,537 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:17,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, 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-31 17:11:17,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,565 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-31 17:11:17,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-31 17:11:17,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,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 35 treesize of output 61 [2019-01-31 17:11:17,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,627 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-31 17:11:17,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-31 17:11:17,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:17,661 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:17,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 35 treesize of output 75 [2019-01-31 17:11:17,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:17,699 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-31 17:11:17,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-31 17:11:17,723 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-31 17:11:17,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:17,774 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-31 17:11:17,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:17,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:11:17,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:17,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:17,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:17,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:17,793 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-01-31 17:11:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:20,677 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-01-31 17:11:20,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:20,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:11:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:20,679 INFO L225 Difference]: With dead ends: 279 [2019-01-31 17:11:20,679 INFO L226 Difference]: Without dead ends: 272 [2019-01-31 17:11:20,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:11:20,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-31 17:11:22,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-01-31 17:11:22,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-31 17:11:22,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-01-31 17:11:22,709 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-01-31 17:11:22,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:22,709 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-01-31 17:11:22,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-01-31 17:11:22,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:11:22,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:22,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:22,710 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-01-31 17:11:22,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:22,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:22,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:22,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:22,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:22,955 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-31 17:11:22,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:22,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:22,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:22,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:22,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:22,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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:22,964 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:11:22,965 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:11:22,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:11:22,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:22,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:22,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, 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-31 17:11:22,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,979 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-31 17:11:22,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,982 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-31 17:11:22,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-31 17:11:22,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:22,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-01-31 17:11:22,996 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,052 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,077 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-31 17:11:23,077 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:23,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,117 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-31 17:11:23,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,164 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-31 17:11:23,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:23,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,201 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:23,202 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-31 17:11:23,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,243 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-31 17:11:23,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:23,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-31 17:11:23,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,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-31 17:11:23,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:23,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:23,369 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:23,370 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 106 [2019-01-31 17:11:23,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:23,418 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-31 17:11:23,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:23,448 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-31 17:11:23,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:23,510 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-31 17:11:23,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:23,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-31 17:11:23,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:23,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-31 17:11:23,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-31 17:11:23,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:11:23,528 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-01-31 17:11:26,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:26,286 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-01-31 17:11:26,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:26,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-31 17:11:26,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:26,288 INFO L225 Difference]: With dead ends: 256 [2019-01-31 17:11:26,288 INFO L226 Difference]: Without dead ends: 249 [2019-01-31 17:11:26,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:11:26,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-31 17:11:28,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-01-31 17:11:28,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-31 17:11:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-01-31 17:11:28,314 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-01-31 17:11:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:28,314 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-01-31 17:11:28,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-31 17:11:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-01-31 17:11:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:11:28,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:28,315 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:28,315 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:28,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:28,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-01-31 17:11:28,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:28,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:28,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:28,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:28,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:28,511 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-31 17:11:28,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:28,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:28,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:28,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:28,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:28,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:28,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:11:28,521 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:11:28,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:11:28,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:28,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:28,530 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-31 17:11:28,537 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-31 17:11:28,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-31 17:11:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-31 17:11:28,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:28,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,583 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,630 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-31 17:11:28,631 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-31 17:11:28,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,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, 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-31 17:11:28,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,694 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-31 17:11:28,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:11:28,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:28,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,752 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-31 17:11:28,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-31 17:11:28,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,780 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:28,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-31 17:11:28,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,817 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-31 17:11:28,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-31 17:11:28,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:28,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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 89 [2019-01-31 17:11:28,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:28,889 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-31 17:11:28,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-01-31 17:11:28,919 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-31 17:11:28,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:28,968 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-31 17:11:28,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:28,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-31 17:11:28,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:28,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:11:28,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:11:28,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:11:28,987 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-01-31 17:11:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:31,501 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-01-31 17:11:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-31 17:11:31,502 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-31 17:11:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:31,503 INFO L225 Difference]: With dead ends: 234 [2019-01-31 17:11:31,503 INFO L226 Difference]: Without dead ends: 207 [2019-01-31 17:11:31,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:31,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-31 17:11:31,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-01-31 17:11:31,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-31 17:11:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-01-31 17:11:31,968 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-01-31 17:11:31,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:31,968 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-01-31 17:11:31,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:11:31,968 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-01-31 17:11:31,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:11:31,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:31,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:31,969 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:31,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:31,969 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-01-31 17:11:31,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:31,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:31,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:32,209 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-31 17:11:32,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:32,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:32,210 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-31 17:11:32,210 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-31 17:11:32,211 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-31 17:11:32,211 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:11:32,212 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:11:32,212 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-31 17:11:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:32,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:11:32,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:32,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:32,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:32,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:32,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:32,229 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-31 17:11:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,231 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-31 17:11:32,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,240 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-31 17:11:32,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,246 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-31 17:11:32,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,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-31 17:11:32,264 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,318 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,347 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:32,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,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 72 [2019-01-31 17:11:32,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,431 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-31 17:11:32,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:32,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:32,473 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-31 17:11:32,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,521 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-31 17:11:32,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:32,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,571 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-31 17:11:32,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,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-31 17:11:32,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:32,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,667 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:32,668 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 99 [2019-01-31 17:11:32,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:11:32,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:32,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:32,770 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:32,770 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-31 17:11:32,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:32,819 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-31 17:11:32,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:32,847 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-31 17:11:32,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:32,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:32,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-31 17:11:32,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:32,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:11:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:11:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-31 17:11:32,959 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-01-31 17:11:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:34,314 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-01-31 17:11:34,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:11:34,314 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-31 17:11:34,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:34,315 INFO L225 Difference]: With dead ends: 76 [2019-01-31 17:11:34,315 INFO L226 Difference]: Without dead ends: 69 [2019-01-31 17:11:34,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-31 17:11:34,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-31 17:11:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-01-31 17:11:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-31 17:11:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-01-31 17:11:34,842 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-01-31 17:11:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:34,842 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-01-31 17:11:34,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:11:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-01-31 17:11:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:11:34,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:34,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:34,843 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:34,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-01-31 17:11:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:34,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:34,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:35,067 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-31 17:11:35,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:35,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:35,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:35,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:35,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:35,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:35,075 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:11:35,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:11:35,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:11:35,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:35,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:35,087 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-31 17:11:35,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,091 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-31 17:11:35,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-01-31 17:11:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,102 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-31 17:11:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,110 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-31 17:11:35,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,139 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,154 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,195 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:35,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,233 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-31 17:11:35,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,276 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-31 17:11:35,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:35,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:35,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,370 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-31 17:11:35,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:35,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,412 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:35,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 99 [2019-01-31 17:11:35,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,464 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-31 17:11:35,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:35,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,504 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:35,505 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-31 17:11:35,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,556 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-31 17:11:35,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:35,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:35,599 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:35,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:35,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:35,647 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-31 17:11:35,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:35,676 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-31 17:11:35,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:35,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:35,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:35,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-31 17:11:35,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:35,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:11:35,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:11:35,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:35,775 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-01-31 17:11:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:37,119 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-01-31 17:11:37,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:11:37,119 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-31 17:11:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:37,120 INFO L225 Difference]: With dead ends: 75 [2019-01-31 17:11:37,120 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 17:11:37,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:11:37,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 17:11:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-01-31 17:11:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-31 17:11:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-01-31 17:11:37,606 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-01-31 17:11:37,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:37,606 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-01-31 17:11:37,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:11:37,606 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-01-31 17:11:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:11:37,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:37,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:37,607 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:37,607 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-01-31 17:11:37,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:37,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:37,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:37,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:37,817 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 25 [2019-01-31 17:11:37,991 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-31 17:11:37,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:37,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:37,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:37,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:37,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:37,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 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:38,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:11:38,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:11:38,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:11:38,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:11:38,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:38,008 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-31 17:11:38,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,011 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-31 17:11:38,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,015 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-31 17:11:38,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,023 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-31 17:11:38,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,030 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-31 17:11:38,031 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,075 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,114 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:38,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,200 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-31 17:11:38,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:38,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:38,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,298 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-31 17:11:38,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:38,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,342 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:38,343 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 99 [2019-01-31 17:11:38,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,394 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-31 17:11:38,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:38,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:38,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-01-31 17:11:38,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,494 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-31 17:11:38,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:38,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:38,536 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:38,537 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-31 17:11:38,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:38,591 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-31 17:11:38,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:38,618 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-31 17:11:38,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:11:38,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:38,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-31 17:11:38,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:38,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:11:38,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:11:38,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:38,715 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-01-31 17:11:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:40,522 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-01-31 17:11:40,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:11:40,523 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-31 17:11:40,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:40,523 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:11:40,523 INFO L226 Difference]: Without dead ends: 84 [2019-01-31 17:11:40,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:11:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-31 17:11:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-01-31 17:11:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-31 17:11:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-01-31 17:11:41,327 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-01-31 17:11:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:41,327 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-01-31 17:11:41,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:11:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-01-31 17:11:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-31 17:11:41,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:11:41,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:11:41,327 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:11:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:11:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-01-31 17:11:41,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:11:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:41,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:11:41,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:11:41,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:11:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:41,599 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-31 17:11:41,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:41,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:11:41,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:11:41,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:11:41,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:11:41,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-31 17:11:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:11:41,608 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:11:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:11:41,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:11:41,615 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-31 17:11:41,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,618 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-31 17:11:41,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,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 23 treesize of output 37 [2019-01-31 17:11:41,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,628 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-31 17:11:41,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,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, 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-31 17:11:41,634 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,663 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,700 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-31 17:11:41,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,762 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-31 17:11:41,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,804 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-31 17:11:41,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-31 17:11:41,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,848 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:41,849 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-31 17:11:41,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:41,897 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-31 17:11:41,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-01-31 17:11:41,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:41,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-31 17:11:41,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:42,035 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-31 17:11:42,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:42,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,080 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:42,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:42,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:42,131 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-31 17:11:42,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:42,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:11:42,176 INFO L683 Elim1Store]: detected equality via solver [2019-01-31 17:11:42,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-31 17:11:42,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:11:42,230 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-31 17:11:42,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-31 17:11:42,263 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-31 17:11:42,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:11:42,358 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-31 17:11:42,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:11:42,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-31 17:11:42,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:11:42,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-31 17:11:42,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-31 17:11:42,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-31 17:11:42,377 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-01-31 17:11:43,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:11:43,888 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-01-31 17:11:43,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:11:43,888 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-31 17:11:43,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:11:43,889 INFO L225 Difference]: With dead ends: 67 [2019-01-31 17:11:43,889 INFO L226 Difference]: Without dead ends: 0 [2019-01-31 17:11:43,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:11:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-31 17:11:43,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-31 17:11:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-31 17:11:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-31 17:11:43,890 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-31 17:11:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:11:43,890 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-31 17:11:43,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-31 17:11:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-31 17:11:43,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-31 17:11:43,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-31 17:11:44,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:44,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:44,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:44,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:45,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:46,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:47,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:47,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:47,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:47,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:47,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:47,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:51,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:52,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:53,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:57,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:57,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:57,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:59,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:11:59,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:03,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:03,617 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:03,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:03,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:03,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:03,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:04,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:04,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:04,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:04,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:04,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:04,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:04,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:07,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:17,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:18,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:18,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:18,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:18,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:24,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:36,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:44,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:44,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:45,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:45,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:52,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:53,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:53,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:53,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:53,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:12:53,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:01,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:01,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:05,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:05,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:05,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:05,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:05,471 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:05,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:12,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:13:53,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:14:07,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:14:07,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:14:07,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:14:26,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:14:26,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:14:26,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-31 17:14:29,824 WARN L181 SmtUtils]: Spent 2.77 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-01-31 17:18:18,244 WARN L181 SmtUtils]: Spent 3.81 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-01-31 17:18:18,248 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:18:18,248 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-01-31 17:18:18,248 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-01-31 17:18:18,248 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-31 17:18:18,248 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-31 17:18:18,248 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-01-31 17:18:18,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-31 17:18:18,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-31 17:18:18,249 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-31 17:18:18,249 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-31 17:18:18,249 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-31 17:18:18,249 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-01-31 17:18:18,250 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-01-31 17:18:18,267 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:18:18 BoogieIcfgContainer [2019-01-31 17:18:18,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-31 17:18:18,268 INFO L168 Benchmark]: Toolchain (without parser) took 701196.89 ms. Allocated memory was 142.1 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 109.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-01-31 17:18:18,269 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-31 17:18:18,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.64 ms. Allocated memory is still 142.1 MB. Free memory was 109.3 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-31 17:18:18,269 INFO L168 Benchmark]: Boogie Preprocessor took 23.24 ms. Allocated memory is still 142.1 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:18:18,269 INFO L168 Benchmark]: RCFGBuilder took 409.61 ms. Allocated memory is still 142.1 MB. Free memory was 105.9 MB in the beginning and 94.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-01-31 17:18:18,270 INFO L168 Benchmark]: TraceAbstraction took 700706.36 ms. Allocated memory was 142.1 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 94.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. [2019-01-31 17:18:18,271 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 142.1 MB. Free memory is still 110.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 53.64 ms. Allocated memory is still 142.1 MB. Free memory was 109.3 MB in the beginning and 107.0 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.24 ms. Allocated memory is still 142.1 MB. Free memory was 107.0 MB in the beginning and 105.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 409.61 ms. Allocated memory is still 142.1 MB. Free memory was 105.9 MB in the beginning and 94.8 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 700706.36 ms. Allocated memory was 142.1 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 94.6 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 700.6s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 142.2s AutomataDifference, 0.0s DeadEndRemovalTime, 394.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 51.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 59.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 59.4s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 165.9s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 228.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 97.4s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (1)] Forcibly destroying the process Received shutdown request...